717 search results - page 74 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
CEC
2007
IEEE
15 years 1 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...
BIRTHDAY
2003
Springer
15 years 3 months ago
2003
Springer
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
187
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...