1332 search results - page 174 / 267 » Combinatorial Algorithms |
STACS
2010
Springer
14 years 4 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
CP
2009
Springer
14 years 3 months ago
2009
Springer
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
IROS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We address the mutual localization problem for a multi-robot system, under the assumption that each robot is equipped with a sensor that provides a measure of the relative posi...
EMO
2009
Springer
14 years 3 months ago
2009
Springer
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
EUROCAST
2009
Springer
14 years 3 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...