Sciweavers

1559 search results - page 228 / 312
» Fundamentals of Generic Programming
Sort
View
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 4 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
CF
2009
ACM
15 years 4 months ago
Space-and-time efficient garbage collectors for parallel systems
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
Shaoshan Liu, Ligang Wang, Xiao-Feng Li, Jean-Luc ...
PAM
2007
Springer
15 years 3 months ago
Two Days in the Life of the DNS Anycast Root Servers
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
Ziqian Liu, Bradley Huffaker, Marina Fomenkov, Nev...
IMC
2006
ACM
15 years 3 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
DASFAA
2005
IEEE
106views Database» more  DASFAA 2005»
15 years 3 months ago
Real Datasets for File-Sharing Peer-to-Peer Systems
The fundamental drawback of unstructured peer-to-peer (P2P) networks is the flooding-based query processing protocol that seriously limits their scalability. As a result, a signi...
Shen-Tat Goh, Panos Kalnis, Spiridon Bakiras, Kian...