Sciweavers

11371 search results - page 372 / 2275
» The network inhibition problem
Sort
View
ANTSW
2004
Springer
16 years 9 days ago
An Ant Approach to Membership Overlay Design
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
Vittorio Maniezzo, Marco A. Boschetti, Márk...
CIA
2008
Springer
15 years 9 months ago
Filter Allocation Using Iterative ECNP
Network devices can filter traffic in order to protect end-user computers against network worms and other threats. Since these devices have very limited memories and cannot deploy ...
Jan Tozicka, Stepán Urban, Magdalena Prokop...
UAI
2004
15 years 8 months ago
Annealed MAP
Maximum a Posteriori assignment (MAP) is the problem of finding the most probable instantiation of a set of variables given the partial evidence on the other variables in a Bayesi...
Changhe Yuan, Tsai-Ching Lu, Marek J. Druzdzel
TON
2008
99views more  TON 2008»
15 years 6 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
ICDE
2005
IEEE
164views Database» more  ICDE 2005»
16 years 8 months ago
Knowledge Discovery from Transportation Network Data
Transportation and Logistics are a major sector of the economy, however data analysis in this domain has remained largely in the province of optimization. The potential of data mi...
Wei Jiang, Jaideep Vaidya, Zahir Balaporia, Chris ...