Sciweavers

15485 search results - page 2868 / 3097
» Computing Optimal Subsets
Sort
View
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
16 years 2 days ago
Evolving petri nets to represent metabolic pathways
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
Jeremiah Nummela, Bryant A. Julstrom
ICS
2005
Tsinghua U.
16 years 2 days ago
High performance support of parallel virtual file system (PVFS2) over Quadrics
Parallel I/O needs to keep pace with the demand of high performance computing applications on systems with ever-increasing speed. Exploiting high-end interconnect technologies to ...
Weikuan Yu, Shuang Liang, Dhabaleswar K. Panda
STACS
2005
Springer
16 years 1 days ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
CF
2004
ACM
15 years 12 months ago
Improving the execution time of global communication operations
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
15 years 12 months ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...
« Prev « First page 2868 / 3097 Last » Next »