Sciweavers

257 search results - page 28 / 52
» Breaking Value Symmetry
Sort
View
PR
2000
130views more  PR 2000»
13 years 7 months ago
Self-annealing and self-annihilation: unifying deterministic annealing and relaxation labeling
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
Anand Rangarajan
ICRA
2010
IEEE
112views Robotics» more  ICRA 2010»
13 years 6 months ago
On the solvability of the Mutual Localization problem with Anonymous Position Measures
— This paper formulates and investigates a novel problem called Mutual Localization with Anonymous Position Measures. This is an extension of Mutual Localization with Position Me...
Antonio Franchi, Giuseppe Oriolo, Paolo Stegagno
ANOR
2011
131views more  ANOR 2011»
13 years 2 months ago
A branch-and-bound algorithm for hard multiple knapsack problems
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
Alex S. Fukunaga
CORR
2011
Springer
207views Education» more  CORR 2011»
13 years 2 months ago
The AllDifferent Constraint with Precedences
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
Christian Bessiere, Nina Narodytska, Claude-Guy Qu...
CCE
2011
12 years 11 months ago
Time representations and mathematical models for process scheduling problems
During the last 15 years, many mathematical models have been developed in order to solve process operation scheduling problems, using discrete or continuous time representations. ...
Sylvain Mouret, Ignacio E. Grossmann, Pierre Pesti...