330 search results - page 52 / 66 » Diagnosing and Solving Over-Determined Constraint Satisfacti... |
111
Voted
ICST
2010
IEEE
15 years 11 days ago
2010
IEEE
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
125
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. 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 de...
125
Voted
PPDP
2010
Springer
15 years 7 days ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
94
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. The structure of a plan prescribes which actions have to...
127
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...