Jams: Difference between revisions
Jump to navigation
Jump to search
(Added problems jam for this spring) |
|||
Line 8: | Line 8: | ||
* January 25-27, 2008: [[Activity Jam Melbourne]] - right before [http://linux.conf.au/ Linux.conf.au] |
* January 25-27, 2008: [[Activity Jam Melbourne]] - right before [http://linux.conf.au/ Linux.conf.au] |
||
* February or March 2008 -- Help to plan it! [[Problems Jam]] |
* February or March 2008 -- Help to plan it! [[Problems Jam]] |
||
* February 9, 2008: 2nd OLPC Game Jam Nepal - External link: [http://forum.olenepal.org/viewtopic.php?t=3 OLPC Game Jam Nepal] |
|||
== Past OLPC Jams == |
== Past OLPC Jams == |
Revision as of 05:03, 31 January 2008
What is an OLPC Jam?
An OLPC Jam is an creative event designed to encourage (simultaneously) experimentation and innovation in the field participants are Jamming in and to produce open-licence content for the OLPC project in a short amount of time. Experienced, prepared participants work in small teams to collaborate with domain and local experts and produce a concrete product to a pre-specified problem; the creative output of the event is deployed in the field directly after the Jam. It's high-intensity improvisational fun - some participants say they've never created in such a productive development environment before.
Upcoming Jams
- September 21-23, 2007: Journalism Jam New York -
- October 5-7, 2007: Curriculum Jam Fall 2007
- January 25-27, 2008: Activity Jam Melbourne - right before Linux.conf.au
- February or March 2008 -- Help to plan it! Problems Jam
- February 9, 2008: 2nd OLPC Game Jam Nepal - External link: OLPC Game Jam Nepal
Past OLPC Jams
- August 6, 2007: Curriculum Jam Nepal
- Curriculum Jam Taipei (also known as Free Content Jam Taipei) - right before Wikimania, in parallel with Hacking Days
- Game Jam Boston June 2007
Jam Resources
- How To Run A Jam - also known as the Jam Cookbook, this is a guide for how to set up and run a Jam in your area.
- Jam in a box - proposal in development which may or may not happen, but comments and ideas are welcome. Would this be helpful to have?