2109 search results - page 68 / 422 » Solving Necklace Constraint Problems |
165
click to vote
LICS
2010
IEEE
15 years 2 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
124
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
134
click to vote
ICAI
2004
15 years 6 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...
143
click to vote
IFIP12
2004
15 years 6 months ago
2004
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
132
click to vote
EOR
2008
15 years 4 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...