1453 search results - page 183 / 291 » Partial Constraint Satisfaction |
137
click to vote
WSC
2007
15 years 7 months ago
2007
During service engagements, project managers frequently encounter resource constraint issues. For each resource shortfall encountered, a project manager must decide among a narrow...
155
click to vote
IJCAI
2003
15 years 6 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
126
click to vote
AAAI
1997
15 years 6 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
146
click to vote
AIPS
1994
15 years 6 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
123
click to vote
ECAI
2010
Springer
15 years 5 months ago
2010
Springer
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed sto...