Sciweavers

3433 search results - page 480 / 687
» Heuristics for a bidding problem
Sort
View
IACR
2011
141views more  IACR 2011»
14 years 6 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
PAMI
2012
13 years 9 months ago
Learning Optimal Embedded Cascades
—The problem of automatic and optimal design of embedded object detector cascades is considered. Two main challenges are identified: optimization of the cascade configuration and...
Mohammad Javad Saberian, Nuno Vasconcelos
FOCS
2009
IEEE
16 years 1 months ago
(Meta) Kernelization
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
16 years 24 days ago
Experimental analysis of binary differential evolution in dynamic environments
Many real-world optimization problems are dynamic in nature. The interest in the Evolutionary Algorithms (EAs) community in applying EA variants to dynamic optimization problems h...
Alp Emre Kanlikilicer, Ali Keles, Sima Uyar
CSCLP
2004
Springer
16 years 1 days ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry