Sciweavers

1568 search results - page 22 / 314
» The problem of examination questions in algorithmics
Sort
View
ECOOPW
1999
Springer
15 years 2 months ago
UML Semantics FAQ
This paper reports the results of a workshop held at ECOOP’99. The workshop was set up to find answers to questions fundamental to the definition of a semantics for the Unifie...
Stuart Kent, Andy Evans, Bernhard Rumpe
SAC
2003
ACM
15 years 3 months ago
Are Multiagent Algorithms Relevant for Real Hardware? A Case Study of Distributed Constraint Algorithms
Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigatio...
Paul Scerri, Pragnesh Jay Modi, Wei-Min Shen, Mili...
JDA
2010
88views more  JDA 2010»
14 years 8 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
CORR
2008
Springer
121views Education» more  CORR 2008»
14 years 10 months ago
On the Application of Hierarchical Coevolutionary Genetic Algorithms: Recombination and Evaluation Partners
This paper examines the use of a hierarchical coevolutionary genetic algorithm under different partnering strategies. Cascading clusters of sub-populations are built from the bott...
Uwe Aickelin, Larry Bull
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
14 years 10 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
Dániel Marx, Ildikó Schlotter