1453 search results - page 206 / 291 » Partial Constraint Satisfaction |
108
click to vote
AMET
1998
Springer
15 years 4 months ago
1998
Springer
Software agents help automate a variety of tasks including those involved in buying and selling products over the Internet. Although shopping agents provide convenience for consume...
105
click to vote
ECP
1997
Springer
15 years 4 months ago
1997
Springer
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
HICSS
1994
IEEE
15 years 4 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
EVOW
2010
Springer
15 years 3 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...
CEC
2007
IEEE
15 years 3 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...