Sciweavers

173 search results - page 15 / 35
» Search Complexities for HTN Planning
Sort
View
JAIR
2008
130views more  JAIR 2008»
13 years 7 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
COMPGEOM
2005
ACM
13 years 9 months ago
The Visibility-Voronoi Complex and Its Applications
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
Ron Wein, Jur P. van den Berg, Dan Halperin
AIPS
2009
13 years 8 months ago
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
Despite its ubiquitous presence, very little is known about the odds of winning the simple card game of Klondike Solitaire. The main goal of this paper is to investigate the use o...
Ronald Bjarnason, Alan Fern, Prasad Tadepalli
IPPS
2006
IEEE
14 years 1 months ago
Workforce planning with parallel algorithms
Workforce planning is an important activity that enables organizations to determine the workforce needed for continued success. A workforce planning problem is a very complex task...
Enrique Alba, Gabriel Luque, Francisco Luna
FLAIRS
2007
13 years 9 months ago
The Evolution and Evaluation of an Internet Search Tool for Information Analysts
We are working on a project aimed at building next generation analyst support tools that focus analysts’ attention on the most critical and novel information found within the da...
Elizabeth T. Whitaker, Robert L. Simpson Jr.