1639 search results - page 53 / 328 » Anytime Heuristic Search |
130
Voted
UAI
2000
15 years 1 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
123
click to vote
AAAI
2011
14 years 15 days ago
2011
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
100
click to vote
ICTAI
2009
IEEE
14 years 10 months ago
2009
IEEE
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
111
click to vote
KR
2004
Springer
15 years 5 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
IJCBDD
2008
15 years 15 days ago
2008
: Phylogenetic search is a key tool used in a variety of biological research endeavors. However, this search problem is known to be computationally difficult, due to the astronomic...