914 search results - page 84 / 183 » The Computational Complexity of Probabilistic Planning |
HICSS
2002
IEEE
15 years 4 months ago
2002
IEEE
We propose a web-based computer-assisted tool for diagnosing progress in international negotiation. The system is based on a general linear model. Innovative features of the progr...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents a kernel density estimation method by means of real-coded crossovers. Estimation of density algorithms (EDAs) are evolutionary optimization techniques, which d...
120
click to vote
UAI
2008
15 years 1 months ago
2008
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
SYNASC
2006
IEEE
15 years 5 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
SMA
2010
ACM
15 years 2 days ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...