1639 search results - page 92 / 328 » Anytime Heuristic Search |
104
Voted
ISVLSI
2005
IEEE
15 years 6 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...
106
Voted
BIBM
2009
IEEE
15 years 4 months ago
2009
IEEE
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
117
click to vote
PPSN
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
96
Voted
IUI
2009
ACM
15 years 9 months ago
2009
ACM
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
112
Voted
ICASSP
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper proposes a method to optimize Viterbi beam search based on search error risk minimization in large vocabulary continuous speech recognition (LVCSR). Most speech recogni...