1971 search results - page 188 / 395 » Tabu search - Uncharted domains |
195
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
197
click to vote
AIPS
2006
15 years 7 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
166
click to vote
ECIS
2000
15 years 7 months ago
2000
Abstract-The information era has brought with it the wellknown problem of 'Information Explosion'. There are many and varied search engines on the Internet but it is stil...
176
click to vote
AIPS
2010
15 years 6 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
168
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...