Sciweavers

1798 search results - page 107 / 360
» A Tree for All Seasons
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
14 years 1 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
14 years 27 days ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
IDA
2010
Springer
13 years 10 months ago
Oracle Coached Decision Trees and Lists
This paper introduces a novel method for obtaining increased predictive performance from transparent models in situations where production input vectors are available when building...
Ulf Johansson, Cecilia Sönströd, Tuve L&...
ICWS
2010
IEEE
13 years 10 months ago
Highly Scalable Web Service Composition Using Binary Tree-Based Parallelization
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
Patrick Hennig, Wolf-Tilo Balke
AAAI
2006
13 years 10 months ago
Decision Tree Methods for Finding Reusable MDP Homomorphisms
straction is a useful tool for agents interacting with environments. Good state abstractions are compact, reuseable, and easy to learn from sample data. This paper and extends two...
Alicia P. Wolfe, Andrew G. Barto