400 search results - page 28 / 80 » Backtracking |
AAAI
2008
14 years 3 days ago
2008
Previous studies have demonstrated that encoding a Bayesian network into a SAT-CNF formula and then performing weighted model counting using a backtracking search algorithm can be...
CP
2008
Springer
13 years 11 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
ICWS
2008
IEEE
13 years 11 months ago
2008
IEEE
The extensibility, flexibility, expressiveness, and platform-neutrality of XML delivers key advantages for interoperability. The interoperability of XML Web services often comes a...
IJCAI
2003
13 years 11 months ago
2003
A computational cognitive model of Web navigation is a working computer system that simulates human users searching for items in a Web site. A fully working model must automate asp...
AAAI
1997
13 years 11 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...