Sciweavers

555 search results - page 88 / 111
» Improved results for a memory allocation problem
Sort
View
PPOPP
2010
ACM
15 years 7 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 6 months ago
Obstacle-avoiding rectilinear Steiner tree construction
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
Liang Li, Evangeline F. Y. Young
GECCO
2007
Springer
345views Optimization» more  GECCO 2007»
15 years 4 months ago
A novel approach to automatic music transcription using electronic synthesis and genetic algorithms
This paper presents a novel approach to the problem of automatic music transcription using electronic synthesis with genetic algorithms. Although the problem is well known and di...
Gustavo Reis, Francisco Fernández de Vega
CCGRID
2003
IEEE
15 years 3 months ago
Discretionary Caching for I/O on Clusters
I/O bottlenecks are already a problem in many largescale applications that manipulate huge datasets. This problem is expected to get worse as applications get larger, and the I/O ...
Murali Vilayannur, Anand Sivasubramaniam, Mahmut T...
GECCO
2008
Springer
128views Optimization» more  GECCO 2008»
14 years 11 months ago
Adapted Pittsburgh classifier system: building accurate strategies in non markovian environments
This paper focuses on the study of the behavior of a genetic algorithm based classifier system, the Adapted Pittsburgh Classifier System (A.P.C.S), on maze type environments con...
Gilles Énée, Mathias Péroumal...