Sciweavers

728 search results - page 96 / 146
» Compressing combinatorial objects
Sort
View
84
Voted
COMPGEOM
2004
ACM
15 years 6 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
GECCO
2010
Springer
214views Optimization» more  GECCO 2010»
15 years 4 months ago
Mixed-integer evolution strategy using multiobjective selection applied to warehouse design optimization
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
Edgar Reehuis, Thomas Bäck
EKAW
2000
Springer
15 years 4 months ago
KIDS: An Iterative Algorithm to Organize Relational Knowledge
The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of mos...
Isabelle Bournaud, Mélanie Courtine, Jean-D...
124
Voted
AIPS
2007
15 years 3 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao
89
Voted
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 23 days ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...