8.30 - 9.00 | Registration |
9.00 - 9.15 | Opening |
9.15 - 9.40 | Mihai Suciu, Dan Dumitrescu: Many-objective Optimization using Resonance Search |
9.40 - 10.05 | Marko Grgurovic, Andrej Brodnik: Parallel Ant Colony Optimization on the GPU |
10.05 - 10.30 | Dan Dumitrescu, Rodica Ioana Lung, Noémi Gaskó:Detecting equilibria in non-cooperative games using an evolutionary approach |
10.30 - 10.55 | Réka Nagy: Equitable equilibrium in games |
10.55 - 11.20 | Coffee break |
11.20 - 11.45 | Timo Knuutila and Jouni Smed: Cheating prevention in multiplayer online games |
11.45 - 12.10 | Tibor Tajti, Emőd Kovács, and Gábor Kusper: Analysis and Data Mining of the Hungarian Common Sense Database using Kohonen's Self Organizing Networks |
12.10 - 12.35 | András Bóta, Miklós Krész, András Pluhár: The inverse problem of the D-R infection model |
12.35 - 13.00 | Branko Kavsek: Using Clustering Methods to Reduce the Number of Association Rules |
13.00 - 14.00 | Lunch |
14.00 - 14.45 | Keynote lecture György Turán:Directed hypergraphs and Horn formulas |
14.45 - 15.05 | Coffee break |
15.05 - 15.30 | Csaba Fábian, Richárd Némedi, Zoltán Szőke: Optical fiber manufacturing: an application of on-line bin-packing |
15.30 - 15.55 | György Dósa: Online reassignment models for scheduling two uniform machines |
15.55 - 16.20 | János Balogh, József Békési, and Gábor Galambos: Results for some variants of on-line bin packing |
16.20 - 16.45 | Coffee break |
16.45 - 17.10 | David Pas, Andrej Brodnik:ACO for the integrated vehicle-crew scheduling and rostering problem |
17.10 - 17.35 | Nebojsa Gvozdenovic: An integration of vehicle and crew scheduling with crew rostering in Public transport company |
17.35 - 18.00 | Viktor Árgilán, Balázs Dávid, Miklós Krész: The bus rescheduling problem: models and algorithm |
19.00 - | Dinner |
9.00 - 9.25 | Gabriel Istrate: The dynamics of (weak) social balance on networks |
9.25 - 9.50 | Benedek Nagy: Finite and Pushdown Automata with Tranclucent Letters |
9.50 - 10.15 | Gábor Kusper, Gergely Kovásznai, Csaba Biró: Solving Bounded Model Checking Problems by a Multi-Domain Logic Based SAT Solver |
10.15 - 10.40 | Balázs Szörényi: Smart PAC learners and the co-training model |
10.40 - 11.05 | Coffee break |
11.05 - 11.30 | Csanád Imreh: Online geometrical clustering problems |
11.30 - 11.55 | Stefan Wiesberg: Finding the most probable Role Structure in Social Networks |
11.55 - 12.20 | Achim Hildenbrandt: The Target Visitation Problem |
12.20 - 12.45 | Sándor Szabó: Branching rules in clique search for parallel algorithms |
12.45 - 13.00 | Closing |
13.30 - | Lunch |