13841 search results - page 2456 / 2769 » Algorithms and Constraint Programming |
142
click to vote
ISAAC
2005
Springer
15 years 10 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
135
click to vote
ADHOCNOW
2004
Springer
15 years 10 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
118
click to vote
WPES
2003
ACM
15 years 9 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
127
click to vote
EUROPAR
2003
Springer
15 years 9 months ago
2003
Springer
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
152
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...