1639 search results - page 192 / 328 » Anytime Heuristic Search |
SCAI
2008
13 years 10 months ago
2008
We propose a troubleshooting algorithm that can troubleshoot systems with dependent action costs. When actions are performed they may change the way the system is decomposed and af...
AIPS
2003
13 years 10 months ago
2003
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
TREC
2003
13 years 10 months ago
2003
500,000 PubMed abstracts. However, less than 50 documents are relevant for most queries. Applying scoring to all 500,000 abstracts would create a lot of noise. In the first step, ...
AIPS
2010
13 years 9 months ago
2010
We present a planning domain that encodes the problem of generating natural language sentences. This domain has a number of features that provoke fairly unusual behavior in planne...
ENDM
2008
13 years 9 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...