Sciweavers

6897 search results - page 1221 / 1380
» Parallelization of Modular Algorithms
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 8 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 8 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
153
Voted
DAGSTUHL
2007
15 years 6 months ago
Multi-Aspect Tagging for Collaborative Structuring
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
Katharina Morik, Michael Wurst
PDCN
2007
15 years 6 months ago
Modified collision packet classification using counting bloom filter in tuple space
Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet accordi...
Mahmood Ahmadi, Stephan Wong
AAAI
2006
15 years 6 months ago
Collective Construction Using Lego Robots
hibition: Extended Abstract Social insects, such as ants and termites, collectively build large and complex structures, with many individuals following simple rules and no centrali...
Crystal Schuil, Matthew Valente, Justin Werfel, Ra...
« Prev « First page 1221 / 1380 Last » Next »