Sciweavers

673 search results - page 109 / 135
» Approximate coherence-based reasoning
Sort
View
AI
2008
Springer
14 years 12 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
APIN
2010
151views more  APIN 2010»
14 years 12 months ago
Improved PLSOM algorithm
The original Parameter-Less Self-Organising Map (PLSOM) algorithm was introduced as a solution to the problems the Self-Organising Map (SOM) encounters when dealing with certain ty...
Erik Berglund
COGSCI
2008
74views more  COGSCI 2008»
14 years 12 months ago
Optimal Predictions in Everyday Cognition: The Wisdom of Individuals or Crowds?
Griffiths and Tenenbaum (2006) asked individuals to make predictions about the duration or extent of everyday events (e.g., cake baking times), and reported that predictions were ...
Michael C. Mozer, Harold Pashler, Hadjar Homaei
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 12 months ago
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
Sebastian Maneth, Kim Nguyen
CSDA
2008
108views more  CSDA 2008»
14 years 12 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes