Sciweavers

5056 search results - page 337 / 1012
» Network Coding Theory
Sort
View
INFOCOM
2008
IEEE
15 years 10 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
15 years 7 months ago
The Brueckner network: an immobile sorting swarm
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...
William A. Tozier, Michael R. Chesher, Tejinderpal...
IWCMC
2006
ACM
15 years 10 months ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
BIS
2008
134views Business» more  BIS 2008»
15 years 5 months ago
Trustlet, Open Research on Trust Metrics
A trust metric is a technique for predicting how much a user of a social network might trust another user. This is especially beneficial in situations where most users are unknown ...
Paolo Massa, Kasper Souren
SIGIR
2003
ACM
15 years 9 months ago
SETS: search enhanced by topic segmentation
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arran...
Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghav...