Sciweavers

408 search results - page 28 / 82
» A lookahead strategy for solving large planning problems
Sort
View
AAAI
2008
15 years 6 min ago
Planning for Human-Robot Interaction Using Time-State Aggregated POMDPs
In order to interact successfully in social situations, a robot must be able to observe others' actions and base its own behavior on its beliefs about their intentions. Many ...
Frank Broz, Illah R. Nourbakhsh, Reid G. Simmons
SEMWEB
2010
Springer
14 years 7 months ago
Auto-experimentation of KDD Workflows Based on Ontological Planning
One of the problems of Knowledge Discovery in Databases (KDD) is the lack of user support for solving KDD problems. Current Data Mining (DM) systems enable the user to manually des...
Floarea Serban
ECAI
2000
Springer
15 years 2 months ago
Flexible Graphplan
We argued in our Flexible Graphplan (FGP) work that the classical definition of the planning problem is too rigid to capture the full subtlety of many real problems. In light of t...
Ian Miguel, Peter Jarvis, Qiang Shen
ICCBR
2003
Springer
15 years 2 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
SSD
2005
Springer
98views Database» more  SSD 2005»
15 years 3 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...