Sciweavers

14403 search results - page 27 / 2881
» Dynamical Systems Trees
Sort
View
SC
2009
ACM
14 years 4 months ago
Scalable work stealing
Irregular and dynamic parallel applications pose significant challenges to achieving scalable performance on large-scale multicore clusters. These applications often require ongo...
James Dinan, D. Brian Larkins, P. Sadayappan, Srir...
NETWORKING
2004
13 years 11 months ago
A Case for Mesh-Tree-Interaction in End System Multicasting
Abstract. End System Multicasting (ESM) is fast becoming a feasible alternative to IP multicasting. ESM approaches can be broadly classified into two main categories: (i) Tree firs...
Anirban Chakrabarti, Govindarasu Manimaran
INFOCOM
2010
IEEE
13 years 8 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...
DATESO
2009
101views Database» more  DATESO 2009»
13 years 7 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
GECCO
2004
Springer
139views Optimization» more  GECCO 2004»
14 years 3 months ago
Chemical Genetic Programming - Coevolution Between Genotypic Strings and Phenotypic Trees
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...
Wojciech Piaseczny, Hideaki Suzuki, Hidefumi Sawai