Sciweavers

3142 search results - page 88 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
AAAI
2006
15 years 4 months ago
A New Approach to Distributed Task Assignment using Lagrangian Decomposition and Distributed Constraint Satisfaction
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
Katsutoshi Hirayama
COR
2011
14 years 10 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
JGO
2011
89views more  JGO 2011»
14 years 6 months ago
Model building using bi-level optimization
Abstract In many problems from different disciplines such as engineering, physics, medicine, and biology, a series of experimental data is used in order to generate a model that ca...
Georges K. Saharidis, Ioannis P. Androulakis, Mari...
ICCV
2009
IEEE
1655views Computer Vision» more  ICCV 2009»
16 years 8 months ago
Shift-Map Image Editing
Geometric rearrangement of images includes operations such as image retargeting, inpainting, or object rearrangement. Each such operation can be characterized by a shiftmap: the...
Yael Pritch, Eitam Kav-Venaki, Shmuel Peleg
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 6 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack