Sciweavers

810 search results - page 137 / 162
» Solving Time-Dependent Planning Problems
Sort
View
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
14 years 2 months ago
Oracular Partially Observable Markov Decision Processes: A Very Special Case
— We introduce the Oracular Partially Observable Markov Decision Process (OPOMDP), a type of POMDP in which the world produces no observations; instead there is an “oracle,” ...
Nicholas Armstrong-Crews, Manuela M. Veloso
ICDM
2006
IEEE
118views Data Mining» more  ICDM 2006»
14 years 1 months ago
GCA: A Coclustering Algorithm for Thalamo-Cortico-Thalamic Connectivity Analysis
The reciprocal connectivity between the cerebral cortex and the thalamus in a human brain is involved in consciousness and related to various brain disorders, thus, in-vivo analys...
Cui Lin, Shiyong Lu, Xuwei Liang, Jing Hua
ICRA
2005
IEEE
120views Robotics» more  ICRA 2005»
14 years 1 months ago
Hybrid PRM Sampling with a Cost-Sensitive Adaptive Strategy
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...
David Hsu, Gildardo Sánchez-Ante, Zheng Sun
SSD
2005
Springer
98views Database» more  SSD 2005»
14 years 1 months ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
ICCBR
2003
Springer
14 years 1 months ago
Case Mining from Large Databases
Abstract. This paper presents an approach of case mining to automatically discover case bases from large datasets in order to improve both the speed and the quality of case based r...
Qiang Yang, Hong Cheng