Sciweavers

386 search results - page 57 / 78
» Fundamental Questions
Sort
View
MSWIM
2004
ACM
14 years 3 months ago
Exploring long lifetime routing (LLR) in ad hoc networks
In mobile ad hoc networks, node mobility causes links between nodes to break frequently, thus terminating the lifetime of the routes containing those links. An alternative route h...
Zhao Cheng, Wendi Beth Heinzelman
PAM
2004
Springer
14 years 3 months ago
Measurements and Laboratory Simulations of the Upper DNS Hierarchy
Given that the global DNS system, especially at the higher root and top-levels, experiences significant query loads, we seek to answer the following questions: (1) How does the ch...
Duane Wessels, Marina Fomenkov, Nevil Brownlee, Ki...
ICARIS
2003
Springer
14 years 3 months ago
Artificial Immune Systems and the Grand Challenge for Non-classical Computation
The UK Grand Challenges for Computing Research is an initiative to map out certain key areas that could be used to help drive research over the next 10–15 years. One of the ident...
Susan Stepney, John A. Clark, Colin G. Johnson, De...
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 2 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 11 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 ...