Sciweavers

227 search results - page 9 / 46
» Deterministic Sampling Algorithms for Network Design
Sort
View
86
Voted
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
14 years 4 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés
ANOR
2006
133views more  ANOR 2006»
14 years 9 months ago
An integrated model for logistics network design
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
Jean-François Cordeau, Federico Pasin, Mari...
INFOCOM
2010
IEEE
14 years 8 months ago
Delay-Based Network Utility Maximization
—It is well known that max-weight policies based on a queue backlog index can be used to stabilize stochastic networks, and that similar stability results hold if a delay index i...
Michael J. Neely
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
15 years 9 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
75
Voted
SIGMETRICS
2006
ACM
156views Hardware» more  SIGMETRICS 2006»
15 years 3 months ago
Maximizing throughput in wireless networks via gossiping
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
Eytan Modiano, Devavrat Shah, Gil Zussman