Sciweavers

4759 search results - page 862 / 952
» Parallelizing the Phylogeny Problem
Sort
View
119
Voted
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 6 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
CASES
2001
ACM
15 years 6 months ago
Combined partitioning and data padding for scheduling multiple loop nests
With the widening performance gap between processors and main memory, efficient memory accessing behavior is necessary for good program performance. Loop partition is an effective...
Zhong Wang, Edwin Hsing-Mean Sha, Xiaobo Hu
117
Voted
JAVA
2000
Springer
15 years 6 months ago
Bulk file I/O extensions to Java
The file I/O classes present in Java have proven too inefficient to meet the demands of high-performance applications that perform large amounts of I/O. The inefficiencies stem pr...
Dan Bonachea
SPIRE
2000
Springer
15 years 6 months ago
Virtual Test Tubes: A New Methodology for Computing
Biomolecular computing (BMC) aims to capture the innumerable advantages that biological molecules have gained in the course of millions of years of evolution to perform computatio...
Max H. Garzon, Evan Drumwright, Russell J. Deaton,...
LICS
1997
IEEE
15 years 6 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...