Sciweavers

206 search results - page 39 / 42
» Random backtracking in backtrack search algorithms for satis...
Sort
View
TOG
2002
133views more  TOG 2002»
13 years 8 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
ICTAI
2009
IEEE
13 years 6 months ago
Stochastic Offline Programming
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
Yuri Malitsky, Meinolf Sellmann
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
13 years 3 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés
CP
2006
Springer
14 years 4 days ago
Adaptive Clause Weight Redistribution
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abd...
FOCS
2009
IEEE
14 years 3 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...