Sciweavers

1146 search results - page 199 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
JPDC
2007
138views more  JPDC 2007»
13 years 10 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
URBAN
2008
128views more  URBAN 2008»
13 years 10 months ago
Discerning landslide susceptibility using rough sets
Rough set theory has been primarily known as a mathematical approach for analysis of a vague description of objects. This paper explores the use of rough set theory to manage the ...
Pece V. Gorsevski, Piotr Jankowski
CCE
2004
13 years 10 months ago
Optimization under uncertainty: state-of-the-art and opportunities
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
Nikolaos V. Sahinidis
AAMAS
2000
Springer
13 years 10 months ago
Coordinating Mutually Exclusive Resources using GPGP
Hospital Patient Scheduling is an inherently distributed problem because of the way real hospitals are organized. As medical procedures have become more complex, and their associat...
Keith Decker, Jinjiang Li
JAIR
2000
152views more  JAIR 2000»
13 years 10 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht