Sciweavers

51 search results - page 10 / 11
» Embracing the Giant Component
Sort
View
PODC
2005
ACM
13 years 11 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
SASN
2004
ACM
13 years 11 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 7 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
IJCAI
2001
13 years 7 months ago
Executing Reactive, Model-based Programs through Graph-based Temporal Planning
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
Phil Kim, Brian C. Williams, Mark Abramson
CICLING
2005
Springer
13 years 11 months ago
The UNL Initiative: An Overview
We are presenting a description of the UNL initiative based on the Universal Networking Language (UNL). This language was conceived to be the support of the multilingual communicat...
Igor Boguslavsky, Jesús Cardeñosa, C...