13 search results - page 1 / 3 » Using Lookaheads with Optimal Best-First Search |
AAAI
2010
13 years 8 months ago
2010
KI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
ISVLSI
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
ACL
2006
14 years 10 days ago
2006
Recently proposed deterministic classifierbased parsers (Nivre and Scholz, 2004; Sagae and Lavie, 2005; Yamada and Matsumoto, 2003) offer attractive alternatives to generative sta...
SAT
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...