13376 search results - page 422 / 2676 » Problem Solving with |
154
Voted
SARA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we propose a new approach for solving the SAT problem. This approach consists in representing SAT instances thanks to an undirected graph issued from a polynomial t...
139
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
118
click to vote
SLP
1997
15 years 6 months ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
181
click to vote
AAAI
2008
15 years 6 months ago
2008
Symbolic AI systems typically have difficulty reasoning about motion in continuous environments, such as determining whether a cornering car will clear a close obstacle. Bimodal s...
117
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm (GDL) [1] to efficiently solve...