Sciweavers

5699 search results - page 99 / 1140
» Alternating model trees
Sort
View
GECCO
2004
Springer
15 years 9 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
HPCC
2007
Springer
15 years 8 months ago
Power-Aware Fat-Tree Networks Using On/Off Links
Abstract. Nowadays, power consumption reduction techniques are being increasingly used in computer systems, and high-performance computing systems are not an exception. In particul...
Marina Alonso, Salvador Coll, Vicente Santonja, Ju...
GLOBECOM
2008
IEEE
15 years 5 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
PKDD
2005
Springer
142views Data Mining» more  PKDD 2005»
15 years 10 months ago
Speeding Up Logistic Model Tree Induction
Logistic Model Trees have been shown to be very accurate and compact classifiers [8]. Their greatest disadvantage is the computational complexity of inducing the logistic regressi...
Marc Sumner, Eibe Frank, Mark A. Hall
DAC
2006
ACM
16 years 5 months ago
Elmore model for energy estimation in RC trees
This paper presents analysis methods for energy estimation in RC trees driven by time-varying voltage sources, e.g., buffers, timevarying power supplies, and resonant clock genera...
Quming Zhou, Kartik Mohanram