1692 search results - page 296 / 339 » A Dynamic Network Interdiction Problem |
135
click to vote
AAAI
2007
15 years 4 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
103
click to vote
NSDI
2007
15 years 4 months ago
2007
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the...
124
click to vote
CONEXT
2008
ACM
15 years 4 months ago
2008
ACM
The Locator/Identifier Separation Protocol (LISP) is one of the candidate solutions to address the scalability issues in inter-domain routing. The current proposals for its contro...
108
click to vote
NSDI
2004
15 years 3 months ago
2004
We have developed SWAP, a system that automatically detects process dependencies and accounts for such dependencies in scheduling. SWAP uses system call history to determine possi...
105
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...