920 search results - page 49 / 184 » Generating Satisfiable Problem Instances |
ADMA
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
EVOW
2010
Springer
14 years 2 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
KBSE
2002
IEEE
14 years 3 months ago
2002
IEEE
Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are pass...
CCO
2001
Springer
14 years 3 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
CONSTRAINTS
2006
13 years 10 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...