Sciweavers

4542 search results - page 672 / 909
» Design patterns for data structures
Sort
View
HPCA
2011
IEEE
14 years 10 months ago
A new server I/O architecture for high speed networks
Traditional architectural designs are normally focused on CPUs and have been often decoupled from I/O considerations. They are inefficient for high-speed network processing with a...
Guangdeng Liao, Xia Znu, Laxmi N. Bhuyan
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 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
IJCAI
1993
15 years 7 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
TC
2011
15 years 1 months ago
Maximizing Spare Utilization by Virtually Reorganizing Faulty Cache Lines
—Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Since a large fraction of chip area is devoted to on-...
Amin Ansari, Shantanu Gupta, Shuguang Feng, Scott ...
GECCO
2004
Springer
175views Optimization» more  GECCO 2004»
15 years 12 months ago
Enhanced Innovation: A Fusion of Chance Discovery and Evolutionary Computation to Foster Creative Processes and Decision Making
Abstract. Human-based genetic algorithms are powerful tools for organizational modeling. If we enhance them using chance discovery techniques, we obtain an innovative approach for ...
Xavier Llorà, Kei Ohnishi, Ying-Ping Chen, ...