914 search results - page 101 / 183 » The Computational Complexity of Probabilistic Planning |
115
click to vote
RC
2007
14 years 11 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
UAI
1997
15 years 1 months ago
1997
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
118
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper presents a method for visual object categorization based on encoding the joint textural information in objects and the surrounding background, and requiring no segmenta...
HCI
2009
14 years 9 months ago
2009
Abstract. Current commercial mobile navigation systems often use a predetermined scale selection schema without considering differences in spatial complexity of locations. To ident...
GPEM
2008
14 years 12 months ago
2008
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...