|
|
 |
|
|
|
| Activities |
|
|
| organized by the Algorithmics group |
|
|
|
The Tutorials in Algorithm Design are introductory talks of about an
hour by experts in a specific field of Algorithm Design. Everyone interested is invited to attend
these.
|
|
|
|
The Agent colloquium consists of talks of about an hour by experienced researchers. Everyone interested is invited to attend these.
|
|
|
|
The lunch talks are talks during lunch
time. These talks are mainly aimed at members of the Algorithmics group, including Masters students,
but also people from other groups are welcome. This is a forum for interesting
work in progress where you are allowed to eat your lunch.
|
|
|
|
The Journal Club is a meeting to
discuss recent journal papers. This activity is mainly aimed at CABS members,
including Masters students. The Journal Club Log wiki keeps track of which papers have been and are going to be discussed.
|
|
|
|
The monthly master's
meetings are meetings with all the master's students of this group to
stimulate exchange of ideas and experiences.
|
|
|
|
Reserve your beamer through Google
calendar.
|
|
|
|
|
If you are a Master's student of our group, make sure you are
subscribed to the algmasters
mailing list to be updated on all these activities. Anyone else interested
in the CABS colloquium please subscribe to the cabscolloquium
mailing list.
|
|
|
|
| Tutorials in Algorithm Design |
|
|
|
|
|
The Tutorials in Algorithm Design are introductory talks of about an hour (excluding questions) by experts in a specific field of Algorithm Design.
In 2011 we plan to ask well known researchers in fields such as mechanisn design for online scheduling, planning for logistic systems, tree decomposition, combinatorial optimization, etc.
Everyone is invited to attend these.
We aim for such a talk once every two months.
|
|
This series of tutorials is organized by Mathijs de Weerdt. Please contact him for more information.
|
|
Speaker
|
Title / Abstract
|
Date
|
Location
|
| Mark Uetz |
Mechanism Design, Graphs, and Scheduling |
April 26 2011, 9:30-11:00 |
Delft, EWI, 9.130 |
| Rene de Koster |
State of the art
in order picking |
June 21 2011, 10:00-11:00 |
Delft, EWI, 9.130 |
|
|
2011, 15:30-16:30 |
Delft, EWI, 9.130 |
|
Click on the titles to read the abstracts, on the speaker names to go to
their homepages, and click on the location for a
route description.
|
Legend:
| past talks |
| definite talks |
| tentative talks |
|
|
|
|
Top of the page
|
|
| Lunch talks |
|
|
|
|
|
The lunch talks are organized in Delft to enhance cooperation within the Algorithmics group. It is usually held during lunch time on Thursdays. A lunch talk is not a lunch, but a talk!
|
|
|
Announcements will be sent through the
cabs_info
mailing list. This includes all staff members and students in
our group.
|
|
|
These lunch talks are usually organized by Tomas Klos. Please contact him for more information.
|
|
|
Usually we schedule 1:00h for a talk, including questions. Click titles to see abstracts.
|
|
Speaker
|
Title / Abstract
|
Date
|
Location
|
| Renze Steenhuisen |
Coordination with a number of agents |
March 2nd, 2006, 11.30-12.30 |
Delft, EWI, 09.130 |
| Joost de Winter |
Virtual Assistant project |
April 6th, 2006, 11.30-12.30 |
Delft, EWI, 09.130 |
| Adriaan ter Mors |
Coordinating Airport Deicing Agents |
May 4th, 2006, 16.00-17.00 |
Delft, EWI, 09.130 |
| Yingqian Zhang |
Survivability of multiagent systems |
June 8th, 2006, 11.30-12.30 |
Delft, EWI, 09.130 |
| Joost Cassee |
The anthropomorphic mistake |
September 7, 2006, 11.30-12.30 |
Delft, EWI, 09.130 |
| Chetan Yadati |
Switching between Email
processing and other Knowledge work tasks: A semi markov decision process approach |
February 15, 2007, 11.30-12.30 |
Delft, EWI, 08.120 |
| Tamas Mahr |
Designing the Brain of an Agent |
March 15 2007, 11.30-12.30 |
Delft, EWI, 09.120 |
| Marijn Heule |
Parallel SAT Solving Using Big Booleans |
May 24 2007, 11.30-12.30 |
Delft, EWI, 09.120 |
| Sicco Verwer |
(to be announced) |
June 7 2007, 11.30-12.30 |
Delft, EWI, 09.120 |
| Tamas Mahr |
Multi-attribute
auctions |
August 31 2007, 11.30-12.30 |
Delft, EWI, 09.120 |
| Marijn Heule |
Avoiding arithmetic progression by forcing symmetry (slides) |
February 28, 2008, 12.00-13.00 |
Delft, EWI, 09.130 |
| Renze Steenhuisen |
Going Deep (slides) |
February 29, 2008, 12.00-13.00 |
Delft, EWI, 09.130 |
| Sicco Verwer |
Learning timed systems (slides) |
March 28, 2008, 11.00–12.00 |
Delft, EWI, 09.130 |
| Ruben Stranders |
Monitoring Environmental Phenomena with Mobile Sensors (slides) |
April 24, 2008, 12.00–13.00 |
Delft, EWI, 16.140 |
| Steve Alpern |
How well can non-communicating agents achieve spatial dispersion? (slides) |
June 11, 2008, 11.00–12.00 |
Delft, EWI, 09.130 |
| Chetan Yadati |
Autonomous Scheduling |
July 10, 2008, 12.00–13.00 |
Delft, EWI, 09.130 |
| Yingqian Zhang |
Of Mechanism Design and Multiagent Planning |
July 17, 2008, 14.00–15.00 |
Delft, EWI, 09.130 |
| Léon Planken |
P3C: A New Algorithm for the Simple Temporal Problem |
August 28, 2008, 12.00–13.00 |
Delft, EWI, 09.130 |
| Sicco Verwer |
Polynomial distinguishability of timed automata
Efficiently Learning Simple Timed Automata |
September 4, 2008, 12.00–13.00 |
Delft, EWI, 09.130 |
| Marijn Heule |
It's the Encoding, Stupid! Solving edge-matching problems using SAT solvers |
October 1, 2008, 12.00–12.30 |
Delft, EWI, 09.130 |
| Adriaan ter Mors |
Context-Aware Routing and its Applications |
December 9, 2008, 12.00–13.00 |
Delft, EWI, 09.130 |
| Benhan Jalilzadeh |
Employing Mechanism Design for the Online Allocation of Items |
February 3, 2009, 12.00–13.00 |
Delft, EWI, Lipkenszaal |
| Bart de Keijzer |
Computational Complexity of Fair Resource Allocation
|
February 19, 2009, 15.30–16.30 |
Delft, EWI, 09.130 |
| Gerrit Jan van Ahee |
Models for Multi-Agent Learning |
April 8, 2009, 12.00–13.00 |
Delft, EWI, 09.130 |
| Olga Huibregtse |
Application of ant colony optimization to the evacuation problem |
June 17, 2009, 12.00–13.00 |
Delft, EWI, 19.130 |
| Stephan Emmerich |
Plan repair in decoupled Simple Temporal Problems |
November 13, 2009 |
Delft, EWI, 09.130 |
| Marijn Heule |
Blocked Clause Elimination |
March 17, 2010 |
Delft, EWI, 09.130 |
| Léon Planken |
Optimal Temporal Decoupling in Multiagent Systems |
April 28, 2010 |
Delft, EWI, 09.130 |
| Léon Planken |
Incrementally Solving STNs by Enforcing Partial Path Consistency |
May 4, 2010 |
Delft, EWI, 09.130 |
| Marijn Heule |
Automated Satisfaction |
June 11, 2010, 12AM |
Delft, EWI, 09.130 |
| Marijn Heule |
Internal symmetry |
September 3, 2010, 12AM |
Delft, EWI, 09.130 |
| Marijn Heule |
Efficient CNF Simplification based on Binary Implication Graphs |
May 31, 2011, 12AM |
Delft, EWI, 09.130 |
| Léon Planken |
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth |
June 8, 2011, 12AM |
Delft, EWI, 09.130 |
| Frans Oliehoek |
Heuristic Search of Multiagent
Influence Space |
November 10, 15:00-16:00 |
Delft, EWI, 09.130 |
|
|
|
Delft, EWI, 09.130 |
|
Click on the titles to read the abstracts, on the speaker names to go to
their homepages, and click on the location for a
route description.
|
Legend:
| past talks |
| definite talks |
| tentative talks |
|
|
|
|
Top of the page
|
|
| Journal Club |
|
|
|
|
|
Within Algorithmics we do not only research collaborative agents, we are
collaborative agents ourselves. The journal club is one of the means to realize
this collaboration.
|
|
|
In principle, each member of the Algorithmics group is also a member of this journal club.
We meet once every four to eight weeks to discuss the most interesting journal paper(s)
(also for the others)
we have read in these weeks. So what do you need to do?
|
|
|
- Choose a (journal) paper you have read recently for discussing in the
journal club. If you have not read a paper yet, please click on a recent date
from the list at the
journal club page of the CWI, or on the list from our
library.
Try to select a paper on your own research topic that may also be
interesting for some of the other members.
- Add this paper to the list at the Journal Club Log wiki preferrably before the actual meeting. If there are more than 6 papers, the first 6 papers that have been added are invited to be presented the next day. The others are moved to the next meeting.
- Prepare yourself to give a brief summary (about five minutes) of the main results of the paper. (We do not expect slides.)
- In the meeting, in turn, each member gets the opportunity to summarize
his or her paper. Also try to give your opinion on the paper. After that,
others may ask some questions (about five minutes). If you can't answer them all, that's ok: if it
is interesting, others can (of course) decide to read the paper as well.
Master's students are also very much encouraged to come and participate
in the discussion. They are not expected (but are definitely allowed!) to
present a paper themselves.
|
|
|
A reminder will be given through the
cabs_info
mailing list.
|
|
|
|
Top of the page
|
|
| External activities |
|
|
|
|
|
|
TU Delft week calendar
|
|
|
|
|
|
|
|
|
|
Activities
