Sciweavers

1833 search results - page 336 / 367
» A Matrix-Based Approach to the Global Locality Optimization ...
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Adaptive price update in distributed Lagrangian relaxation protocol
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
Katsutoshi Hirayama, Toshihiro Matsui, Makoto Yoko...
VTC
2010
IEEE
135views Communications» more  VTC 2010»
13 years 5 months ago
Biconnecting a Network of Mobile Robots Using Virtual Angular Forces
This paper proposes a new solution to the problem of self-deploying a network of wireless mobile robots with simultaneous consideration to several criteria, that are, the fault-tol...
Arnaud Casteigts, Jeremie Albert, Serge Chaumette,...
ICDCS
2010
IEEE
13 years 11 months ago
P2P Streaming Capacity under Node Degree Bound
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
Shao Liu, Minghua Chen, Sudipta Sengupta, Mung Chi...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 10 days ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
AMEC
2004
Springer
14 years 29 days ago
Bidding for Customer Orders in TAC SCM
Abstract. Supply chains are a current, challenging problem for agentbased electronic commerce. Motivated by the Trading Agent Competition Supply Chain Management (TAC SCM) scenario...
David Pardoe, Peter Stone