Sciweavers

312 search results - page 34 / 63
» Iterative compression and exact algorithms
Sort
View
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 9 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
HEURISTICS
2010
13 years 7 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
ICIP
2009
IEEE
14 years 11 months ago
Monotone Operator Splitting For Optimization Problems In Sparse Recovery
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...
SIGGRAPH
1998
ACM
14 years 2 months ago
Large Steps in Cloth Simulation
The bottle-neck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably ta...
David Baraff, Andrew P. Witkin
IJCAI
1989
13 years 11 months ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks