Sciweavers

43 search results - page 2 / 9
» A Scalable Segmented Decision Tree Abstract Domain
Sort
View
AIPS
2008
13 years 7 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
PPSN
2010
Springer
13 years 3 months ago
Evolving a Single Scalable Controller for an Octopus Arm with a Variable Number of Segments
Abstract. While traditional approaches to machine learning are sensitive to highdimensional state and action spaces, this paper demonstrates how an indirectly encoded neurocontroll...
Brian G. Woolley, Kenneth O. Stanley
JAIR
2011
134views more  JAIR 2011»
13 years 6 days ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
LCPC
2004
Springer
13 years 10 months ago
Branch Strategies to Optimize Decision Trees for Wide-Issue Architectures
Abstract. Branch predictors are associated with critical design issues for nowadays instruction greedy processors. We study two important domains where the optimization of decision...
Patrick Carribault, Christophe Lemuet, Jean-Thomas...
CAV
1999
Springer
104views Hardware» more  CAV 1999»
13 years 9 months ago
On the Representation of Probabilities over Structured Domains
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
Marius Bozga, Oded Maler