10666 search results - page 1386 / 2134 » Quantum programming languages |
162
click to vote
CP
2005
Springer
16 years 29 days ago
2005
Springer
This paper presents a technique for learning parameterized implied constraints. They can be added to a model to improve the solving process. Experiments on implied Gcc constraints ...
198
click to vote
CP
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
163
click to vote
CP
2005
Springer
16 years 29 days ago
2005
Springer
A search algorithm based on non-binary forward checking (nFC) is used to solve the car-sequencing problem. The choice of value ordering heuristics having a dramatic effect on solu...
166
click to vote
CP
2005
Springer
16 years 29 days ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
177
click to vote
CP
2005
Springer
16 years 29 days ago
2005
Springer
Interacting with a web service enabled marketplace in order to achieve a complex task involves sequencing a set of individual service operations, gathering information from the ser...