1603 search results - page 187 / 321 » Multi-Dimensional Heuristic Searching |
108
click to vote
AIPS
2003
15 years 6 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...
151
Voted
TREC
2003
15 years 6 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, ...
145
click to vote
AIPS
2010
15 years 4 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...
109
Voted
ENDM
2008
15 years 4 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...
129
click to vote
TCBB
2008
15 years 4 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...