Sciweavers

791 search results - page 140 / 159
» Approximating the Maximum Sharing Problem
Sort
View
MSN
2005
Springer
14 years 1 months ago
Using MDS Codes for the Key Establishment of Wireless Sensor Networks
Key pre-distribution techniques for security provision of Wireless Sensor Networks (WSNs) have attracted significant interests recently. In these schemes, a relatively small numbe...
Jing Deng, Yunghsiang S. Han
PODC
2010
ACM
13 years 11 months ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
JIRS
2002
137views more  JIRS 2002»
13 years 7 months ago
Mobile Robot Command by Man-Machine Co-Operation - Application to Disabled and Elderly People Assistance
Disabled people assistance is developing thanks to progress of new technologies. A manipulator arm mounted on a mobile robot can assist the disabled person for the partial restora...
Philippe Hoppenot, Etienne Colle
SPAA
2004
ACM
14 years 1 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt
SPAA
2003
ACM
14 years 26 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman