Sciweavers

914 search results - page 68 / 183
» The Computational Complexity of Probabilistic Planning
Sort
View
CEC
2005
IEEE
14 years 4 months ago
Crossing the fabrication gap: evolving assembly plans to build 3-D objects
Evolutionary Computation has demonstrated the ability to design novel and interesting objects. Such objects are increasingly being assembled in the physical world, albeit with some...
John Rieffel, Jordan B. Pollack
ICRA
2005
IEEE
121views Robotics» more  ICRA 2005»
14 years 4 months ago
Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
Erion Plaku, Lydia E. Kavraki
FLAIRS
2007
14 years 1 months ago
Dynamic DDN Construction for Lightweight Planning Architectures
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...
William H. Turkett
IUI
2006
ACM
14 years 4 months ago
Eye-tracking to model and adapt to user meta-cognition in intelligent learning environments
In this paper we describe research on using eye-tracking data for on-line assessment of user meta-cognitive behavior during the interaction with an intelligent learning environmen...
Christina Merten, Cristina Conati
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 11 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...