566 search results - page 57 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
142
Voted
SPATIALCOGNITION
2000
Springer
15 years 4 months ago
2000
Springer
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
102
Voted
AAI
2006
15 years 17 days ago
2006
The problem of finding a high quality timetable for personnel in a hospital ward has been addressed by many researchers, personnel managers and schedulers over a number of years. ...
105
Voted
TCS
2011
14 years 7 months ago
2011
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
105
click to vote
AIPS
2003
15 years 1 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
TASE
2008
IEEE
15 years 12 days ago
2008
IEEE
Dynamic programming, branch-and-bound, and constraint programming are the standard solution principles for nding optimal solutions to machine scheduling problems. We propose a new ...