Sciweavers

432 search results - page 11 / 87
» An optimal algorithm for the distinct elements problem
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
ICASSP
2009
IEEE
13 years 5 months ago
Fast belief propagation process element for high-quality stereo estimation
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
Chao-Chung Cheng, Chia-Kai Liang, Yen-Chieh Lai, H...
ECAI
2008
Springer
13 years 9 months ago
Dynamic Backtracking for Distributed Constraint Optimization
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
Redouane Ezzahir, Christian Bessiere, Imade Benela...
KES
2007
Springer
14 years 1 months ago
Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
Paola Pellegrini, Daniela Favaretto, Elena Moretti
GECCO
2003
Springer
134views Optimization» more  GECCO 2003»
14 years 24 days ago
A Fixed-Length Subset Genetic Algorithm for the p-Median Problem
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
Andrew Lim, Zhou Xu