Sciweavers

2517 search results - page 219 / 504
» The Fairness Challenge in Computer Networks
Sort
View
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 10 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher
CPHYSICS
2006
124views more  CPHYSICS 2006»
15 years 4 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
INFOCOM
2012
IEEE
13 years 6 months ago
On detecting pollution attacks in inter-session network coding
Abstract—Dealing with pollution attacks in inter-session network coding is challenging due to the fact that sources, in addition to intermediate nodes, can be malicious. In this ...
Anh Le, Athina Markopoulou
ANCS
2006
ACM
15 years 10 months ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...
IPPS
1998
IEEE
15 years 8 months ago
HIPIQS: A High-Performance Switch Architecture Using Input Queuing
Switch-based interconnects are used in a number of application domains including parallel system interconnects, local area networks, and wide area networks. However, very few swit...
Rajeev Sivaram, Craig B. Stunkel, Dhabaleswar K. P...