Sciweavers

4345 search results - page 510 / 869
» Temporal Constraint Networks
Sort
View
INFOCOM
2005
IEEE
16 years 11 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
DATE
2004
IEEE
144views Hardware» more  DATE 2004»
15 years 10 months ago
A Framework for Battery-Aware Sensor Management
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
Sridhar Dasika, Sarma B. K. Vrudhula, Kaviraj Chop...
SIROCCO
2004
15 years 8 months ago
Existence of Nash Equilibria in Selfish Routing Problems
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
Alessandro Ferrante, Mimmo Parente
TON
2002
99views more  TON 2002»
15 years 6 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
NOCS
2009
IEEE
16 years 1 months ago
Scalability of network-on-chip communication architecture for 3-D meshes
Design Constraints imposed by global interconnect delays as well as limitations in integration of disparate technologies make 3-D chip stacks an enticing technology solution for m...
Awet Yemane Weldezion, Matt Grange, Dinesh Pamunuw...