79 search results - page 9 / 16 » cp 2006 |
CP
2006
Springer
14 years 2 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
CP
2006
Springer
14 years 2 months ago
2006
Springer
This paper describes a complete and efficient solution to the stochastic allocation and scheduling for Multi-Processor System-on-Chip (MPSoC). Given a conditional task graph charac...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
CP
2006
Springer
14 years 2 months ago
2006
Springer
In this paper we investigate the use of preprocessing when solving Quantified Boolean Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and there...