Sciweavers

16091 search results - page 3180 / 3219
» Solving
Sort
View
ECCC
2011
223views ECommerce» more  ECCC 2011»
13 years 3 months ago
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
EIS
2011
290views ECommerce» more  EIS 2011»
13 years 3 months ago
Code query by example
Most software engineering techniques that deal with software products customization are based on anticipation: The software designer has to foresee, somehow, the future needs for ...
Sebastien Vaucouleur
IJRR
2011
78views more  IJRR 2011»
13 years 3 months ago
Online and Incremental Appearance-based SLAM in Highly Dynamic Environments
This paper presents a novel method for online and incremental appearance-based localization and mapping in a highly dynamic environment. Using position-invariant robust features (...
Aram Kawewong, Noppharit Tongprasit, Sirinart Tang...
IJRR
2011
218views more  IJRR 2011»
13 years 3 months ago
Motion planning under uncertainty for robotic tasks with long time horizons
Abstract Partially observable Markov decision processes (POMDPs) are a principled mathematical framework for planning under uncertainty, a crucial capability for reliable operation...
Hanna Kurniawati, Yanzhu Du, David Hsu, Wee Sun Le...
JAIR
2011
134views more  JAIR 2011»
13 years 3 months 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...
« Prev « First page 3180 / 3219 Last » Next »