1289 search results - page 54 / 258 » Complexity of Counting the Optimal Solutions |
131
click to vote
ACID
2006
15 years 1 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
103
Voted
WDAG
2001
Springer
2001
Springer
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
15 years 5 months ago
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...
86
Voted
ICFEM
2009
Springer
14 years 10 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
71
Voted
IJCAI
1989
15 years 1 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
101
Voted
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...