Sciweavers

1127 search results - page 12 / 226
» New Algorithms for Generalized Network Flows
Sort
View
ATAL
2008
Springer
15 years 7 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...
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
16 years 1 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
GLOBECOM
2007
IEEE
15 years 11 months ago
A Generalized Gradient Scheduling Algorithm in Wireless Networks for Variable Rate Transmission
— Average transmission rate and rate oscillation are two important performance metrics for most wireless services. Both are often needed to be optimized in multi-user scheduling ...
Xiaolu Zhang, Meixia Tao, Chun Sum Ng
230
Voted
ICAISC
2004
Springer
15 years 10 months ago
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
Krzysztof Walkowiak
172
Voted
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 11 months ago
An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem
An Estimation of Distribution Algorithm (EDA) is proposed to approach the Hybrid Flow Shop with Sequence Dependent Setup Times and Uniform Machines in parallel (HFSSDST-UM) proble...
Abdellah Salhi, José Antonio Vázquez...