Sciweavers

339 search results - page 4 / 68
» Is the Euclidean algorithm optimal among its peers
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 28 days ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
ICASSP
2009
IEEE
14 years 2 months ago
Distributed subgradient projection algorithm for convex optimization
—We consider constrained minimization of a sum of convex functions over a convex and compact set, when each component function is known only to a specific agent in a timevarying...
Sundhar Srinivasan Ram, Angelia Nedic, Venugopal V...
GLOBECOM
2010
IEEE
13 years 5 months ago
A Coalition Formation Game in Partition Form for Peer-to-Peer File Sharing Networks
In current peer-to-peer file sharing networks, a large number of peers with heterogeneous connections simultaneously seek to download resources, e.g., files or file fragments, from...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...
GLOBECOM
2008
IEEE
14 years 1 months ago
Foresighted Resource Reciprocation Strategies in P2P Networks
—We consider peer-to-peer (P2P) networks, where multiple peers are interested in sharing content. While sharing resources, autonomous and self-interested peers need to make decis...
Hyunggon Park, Mihaela van der Schaar
CORR
2007
Springer
88views Education» more  CORR 2007»
13 years 7 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo