117 search results - page 22 / 24 » Anti-Sniffing in Unbounded Networks |
CP
2006
Springer
14 years 2 months ago
2006
Springer
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
ALGOSENSORS
2008
Springer
14 years 27 days ago
2008
Springer
We consider the problem of uniformly dispersing mobile robotic sensors in a simply connected orthogonal space of unknown shape. The mobile sensors are injected into the space from ...
PODC
2009
ACM
14 years 11 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
COMCOM
2004
13 years 10 months ago
2004
In the emerging next-generation transport networks, called intelligent optical transport networks, DWDM-based optical components like add-drop multiplexers and optical cross conne...
IOR
2007
13 years 10 months ago
2007
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...