870 search results - page 120 / 174 » Theoretical and experimental results on the goal-plan tree p... |
RSS
2007
14 years 11 months ago
2007
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
118
click to vote
ICDM
2010
IEEE
14 years 8 months ago
2010
IEEE
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
FOCS
1993
IEEE
15 years 2 months ago
1993
IEEE
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
CONSTRAINTS
2006
14 years 10 months ago
2006
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Traditional boosting algorithms for the ranking problems usually employ the pairwise approach and convert the document rating preference into a binary-value label, like RankBoost....