272 search results - page 49 / 55 » A Game-Theoretic Approach to Constraint Satisfaction |
AAAI
2000
14 years 11 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
EC
2008
14 years 9 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
117
click to vote
AAMAS
1999
Springer
14 years 9 months ago
1999
Springer
Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open sys...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
100
click to vote
SIGSOFT
2003
ACM
15 years 10 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...