Sciweavers

698 search results - page 43 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
DAC
2004
ACM
14 years 10 months ago
Refining the SAT decision ordering for bounded model checking
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...
Chao Wang, HoonSang Jin, Gary D. Hachtel, Fabio So...
IJCAI
2007
13 years 10 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
AUTOMATICA
1999
44views more  AUTOMATICA 1999»
13 years 9 months ago
Square-root information filtering and fixed-interval smoothing with singularities
The square-root information filter and smoother algorithms have been generalized to handle singular state transition matrices and perfect measurements. This has been done to allow...
Mark L. Psiaki
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
14 years 2 months ago
Incremental low-discrepancy lattice methods for motion planning
We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the increme...
Stephen R. Lindemann, Steven M. LaValle
ICCSA
2005
Springer
14 years 2 months ago
Comparison of Global Optimization Methods for Drag Reduction in the Automotive Industry
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
Laurent Dumas, Vincent Herbert, Frédé...