4378 search results - page 101 / 876 » On the Complexity of Ordered Colourings |
ENTCS
2006
13 years 9 months ago
2006
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
CSCLP
2005
Springer
14 years 2 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
COCO
2004
Springer
14 years 2 months ago
2004
Springer
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
FOGA
2011
13 years 15 days ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
We study the complexity of a multilateral negotiation framework where autonomous agents agree on a sequence of deals to exchange sets of discrete resources in order to both furthe...