Sciweavers

940 search results - page 116 / 188
» Control Abstractions for Local Search
Sort
View
ATAL
2008
Springer
15 years 5 months ago
On k-optimal distributed constraint optimization algorithms: new bounds and algorithms
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
Emma Bowring, Jonathan P. Pearce, Christopher Port...
132
Voted
GECCO
2007
Springer
289views Optimization» more  GECCO 2007»
15 years 9 months ago
A discrete particle swarm optimization algorithm for the generalized traveling salesman problem
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
132
Voted
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 7 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
139
Voted
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 7 months ago
Inference of genetic networks using S-system: information criteria for model selection
In this paper we present an evolutionary approach for inferring the structure and dynamics in gene circuits from observed expression kinetics. For representing the regulatory inte...
Nasimul Noman, Hitoshi Iba
195
Voted
WOWMOM
2005
ACM
240views Multimedia» more  WOWMOM 2005»
15 years 9 months ago
An Adaptive Routing Protocol for Ad Hoc Peer-to-Peer Networks
Ad hoc networks represent a key factor in the evolution of wireless communications. These networks typically consist of equal nodes that communicate without central control, inter...
Luca Gatani, Giuseppe Lo Re, Salvatore Gaglio