914 search results - page 110 / 183 » The Computational Complexity of Probabilistic Planning |
NIPS
1993
15 years 1 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
108
click to vote
CHI
2008
ACM
15 years 1 months ago
2008
ACM
Usability evaluation methods have a long history of research. Latest contributions significantly raised the validity of method evaluation studies. But there is still a measurement...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. We consider the problem of clustering data into k 2 clusters given complex relations -- going beyond pairwise -- between the data points. The complex n-wise relations ar...
152
click to vote
MOBIHOC
2005
ACM
15 years 11 months ago
2005
ACM
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
ICNC
2009
Springer
15 years 6 months ago
2009
Springer
A model-free, biologically-motivated learning and control algorithm called S-learning is described as implemented in an Surveyor SRV-1 mobile robot. S-learning demonstrated learni...