Webdev:Meetings:2012-05-22: Difference between revisions
Jump to navigation
Jump to search
m (→Open Items) |
(→wenzel) |
||
| Line 57: | Line 57: | ||
== tofumatt == | == tofumatt == | ||
== wenzel == | == wenzel == | ||
* Lots of recruiting work | |||
* newnewtab project planning | |||
* Marketplace submission API planning | |||
Favorite algorithm is the efficient solution to the Traveling Salesman Problem that I am surely going to come up with any day now. Oh, *existing* algorithms. I like [http://en.wikipedia.org/wiki/Minimum_spanning_tree MST] for its simplicity. | |||
== wil == | == wil == | ||
== willkg == | == willkg == | ||
Revision as of 16:41, 22 May 2012
Meeting Info
- Room webdev via Vidyo
- Room 798 via Teleconferencing
- Mountain View office in room PB&J
Meeting notes
- Note-taker: <who>
- Meeting notes: <etherpad link>
Open Items
- Apps Blog posts (moar blogs!)
- Pre-screening coding for job candidates (Laura)
- Notable status updates (Fred, Laura, James, Wil, anyone)
Roundtable
adrian
- In Madrid this week
- Working on moving the very last pieces of SQL in the UI of Socorro
andy
arron
ashort
aricaud
bsavage
bensternthal
craigcook
ckoehler
cmore
davidwalsh
ednapiranha
gkoberger
jlongster
jsocol
kumar
lars
laura
lcrouch
lonnen
lorchard
malexis
mkelly
morgamic
- on vacation. so far being successful at actually being on vacation.
ngoke
peterbe
piotr
pmclanahan
potch
rhelmer
ricky
robhudson
schalk
seanmonstar
ubernostrum
timw
tofumatt
wenzel
- Lots of recruiting work
- newnewtab project planning
- Marketplace submission API planning
Favorite algorithm is the efficient solution to the Traveling Salesman Problem that I am surely going to come up with any day now. Oh, *existing* algorithms. I like MST for its simplicity.