Sciweavers

597 search results - page 86 / 120
» Homomorphisms of random paths
Sort
View
TIT
2010
146views Education» more  TIT 2010»
13 years 4 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
HYBRID
2011
Springer
12 years 9 months ago
Almost sure stability of networked control systems under exponentially bounded bursts of dropouts
A wireless networked control systems (NCS) is a control system whose feedback path is realized over a wireless communication network. The stability of such systems can be problema...
Michael D. Lemmon, Xiaobo Sharon Hu
INFOCOM
2009
IEEE
14 years 4 months ago
Barrier Coverage of Line-Based Deployed Wireless Sensor Networks
— Barrier coverage of wireless sensor networks has been studied intensively in recent years under the assumption that sensors are deployed uniformly at random in a large area (Po...
Anwar Saipulla, Cédric Westphal, Benyuan Li...
SAC
2003
ACM
14 years 3 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 2 months ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...