Sciweavers

4432 search results - page 158 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 7 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
EOR
2007
89views more  EOR 2007»
15 years 3 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...
IPPS
2005
IEEE
15 years 9 months ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
Thomas Fischer, Peter Merz
164
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
Distributed Robust Optimization for Communication Networks
—Robustness of optimization models for networking problems has been an under-explored area. Yet most existing algorithms for solving robust optimization problems are centralized,...
Kai Yang, Yihong Wu, Jianwei Huang, Xiaodong Wang,...
113
Voted
ESA
2008
Springer
83views Algorithms» more  ESA 2008»
15 years 5 months ago
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
This paper re-examines the classical problem of minimizing maximum lateness which is defined as follows: given a collection of n jobs with processing times and due dates, in what o...
Samir Khuller, Julián Mestre