Sciweavers

3049 search results - page 261 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
CSL
2010
Springer
15 years 7 months ago
On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
Yijia Chen, Jörg Flum
SAC
2009
ACM
16 years 1 months ago
A robust and tractable contact model for dynamic robotic simulation
Existing contact modeling in rigid body simulation is inadequate for robotics: no algorithms guarantee both convergence and nonpenetration at multiple contact points in the presen...
Evan Drumwright, Dylan A. Shell
CORR
2010
Springer
89views Education» more  CORR 2010»
15 years 4 months ago
A Microwave Imaging and Enhancement Technique from Noisy Synthetic Data
: An inverse iterative algorithm for microwave imaging based on moment method solution is presented here. The iterative scheme has been developed on constrained optimization techni...
Anjan Kumar Kundu, Bijoy Bandyopadhyay, Sugata San...
CDC
2009
IEEE
125views Control Systems» more  CDC 2009»
15 years 11 months ago
Near-optimal deterministic filtering on the unit circle
— We present a near-optimal deterministic filter for systems that evolve on the unit circle. Unlike suboptimal filtering algorithms that rely on approximations of the system, t...
Paul William Coote, Jochen Trumpf, Robert E. Mahon...
FOCS
1999
IEEE
15 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson