3818 search results - page 409 / 764 » Word Problems on Compressed Words |
174
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
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...
200
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
In this work we present a methodology for intelligent path planning in an uncertain environment using vision like sensors, i.e., sensors that allow the sensing of the environment ...
178
click to vote
AUTOMATICA
2008
15 years 6 months ago
2008
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
159
click to vote
EOR
2006
15 years 6 months ago
2006
This paper describes a framework for analysing matches in multiple data sets. The framework described is quite general and can be applied to a variety of problems where matches ar...
173
click to vote
INFORMATICALT
2008
15 years 6 months ago
2008
This paper studies an adaptive clustering problem. We focus on re-clustering an object set, previously clustered, when the feature set characterizing the objects increases. We prop...