Sciweavers

3533 search results - page 272 / 707
» Locally Optimized RANSAC
Sort
View
GECCO
2010
Springer
213views Optimization» more  GECCO 2010»
15 years 6 months ago
Consultant-guided search algorithms for the quadratic assignment problem
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
Serban Iordache
IOR
2007
58views more  IOR 2007»
15 years 6 months ago
Bounds, Heuristics, and Approximations for Distribution Systems
This paper develops simple approximate methods to analyze a two-stage stochastic distribution system consisting of one warehouse and multiple retailers. We consider local and cent...
Guillermo Gallego, Özalp Özer, Paul H. Z...
TMC
2012
13 years 9 months ago
Message Drop and Scheduling in DTNs: Theory and Practice
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
GECCO
2004
Springer
106views Optimization» more  GECCO 2004»
16 years 2 days ago
Mutation Rates in the Context of Hybrid Genetic Algorithms
Traditionally, the mutation rates of genetic algorithms are fixed or decrease over the generations. Although it seems to be reasonable for classical genetic algorithms, it may not...
Seung-Hee Bae, Byung Ro Moon
JMLR
2012
13 years 9 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint