72 search results - page 5 / 15 » Conflict Analysis in Search Algorithms for Satisfiability |
AIPS
2000
14 years 11 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...
IEICET
2006
14 years 9 months ago
2006
Road traffic incidents analysis has shown that a third of them occurs without any conflict which indicates problems with road following. In this paper a driving safety assistance ...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from [16, 17] finds a satisfying assignment of Φ in pol...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
In this paper the online pull-based broadcast model is considered. In this model, there are n pages of data stored at a server and requests arrive for pages online. When the serve...
AUSAI
2007
Springer
15 years 1 months ago
2007
Springer
Many real-world problems are over-constrained and require search techniques adapted to optimising cost functions rather than searching for consistency. This makes the MAX-SAT probl...