Sciweavers

1063 search results - page 128 / 213
» Programming Methodologies in GCLA
Sort
View
IWMM
1998
Springer
103views Hardware» more  IWMM 1998»
14 years 2 days ago
The Memory Fragmentation Problem: Solved?
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide nearzero fragmentation, once we account for overheads due to impleme...
Mark S. Johnstone, Paul R. Wilson
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
13 years 11 months ago
Evolving kernels for support vector machine classification
While support vector machines (SVMs) have shown great promise in supervised classification problems, researchers have had to rely on expert domain knowledge when choosing the SVM&...
Keith Sullivan, Sean Luke
CORR
2000
Springer
144views Education» more  CORR 2000»
13 years 7 months ago
Sequence-Based Abstract Interpretation of Prolog
-BASED ABSTRACT INTERPRETATION OF PROLOG1 BAUDOUIN LE CHARLIER, SABINA ROSSI, AND PASCAL VAN HENTENRYCK . Abstract interpretation is a general methodology for systematic developmen...
Baudouin Le Charlier, Sabina Rossi, Pascal Van Hen...
EUROPAR
2010
Springer
13 years 9 months ago
Optimized Dense Matrix Multiplication on a Many-Core Architecture
Abstract. Traditional parallel programming methodologies for improving performance assume cache-based parallel systems. However, new architectures, like the IBM Cyclops-64 (C64), b...
Elkin Garcia, Ioannis E. Venetis, Rishi Khan, Guan...
ICCAD
1997
IEEE
106views Hardware» more  ICCAD 1997»
14 years 2 days ago
BIST TPG for faults in system backplanes
A built-in self-test (BIST) methodology to test system backplanes by using BIST functionality in each of its constituent boards is presented. Since the configurations of systems ...
Chen-Huan Chiang, Sandeep K. Gupta