272 search results - page 49 / 55 » A Game-Theoretic Approach to Constraint Satisfaction |
108
click to vote
AAAI
2000
15 years 2 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...
136
click to vote
EC
2008
15 years 1 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 ...
142
click to vote
AAMAS
1999
Springer
15 years 1 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...
111
Voted
CORR
2011
Springer
14 years 5 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 ...
128
click to vote
SIGSOFT
2003
ACM
16 years 2 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 ...