Sciweavers

3047 search results - page 51 / 610
» Randomized Parallel Selection
Sort
View
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
13 years 9 months ago
Randomly Sampling Molecules
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
Leslie Ann Goldberg, Mark Jerrum
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolving ensemble of classifiers in random subspace
Various methods for ensemble selection and classifier combination have been designed to optimize the results of ensembles of classifiers. Genetic algorithm (GA) which uses the div...
Albert Hung-Ren Ko, Robert Sabourin, Alceu de Souz...
ACSD
2003
IEEE
102views Hardware» more  ACSD 2003»
13 years 11 months ago
Specification Coverage Aided Test Selection
In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously prese...
Tuomo Pyhälä, Keijo Heljanko
SC
2005
ACM
14 years 1 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
RANDOM
2001
Springer
14 years 3 days ago
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
Susanne Albers, Carsten Witt