Sciweavers

1182 search results - page 8 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
85
Voted
AAAI
1998
15 years 29 days ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
ATMOS
2008
187views Optimization» more  ATMOS 2008»
15 years 1 months ago
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
Karl Nachtigall, Jens Opitz
ICPR
2000
IEEE
16 years 20 days ago
Motion Segmentation Using Feature Selection and Subspace Method Based on Shape Space
Motion segmentation using feature correspondences can be regarded as a combinatorial problem. A motion segmentation algorithm using feature selection and subspace method is propos...
Naoyuki Ichimura
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 9 months ago
Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...
Francesc Comellas, Jesus Martinez-Navarro
107
Voted
ECCV
2006
Springer
16 years 1 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady