Sciweavers

486 search results - page 52 / 98
» Parallel Algorithms for Relational Coarsest Partition Proble...
Sort
View
PDCN
2007
13 years 9 months ago
One-to-all personalized communication in torus networks
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...
Weizhen Mao, Jie Chen, William A. Watson III
PR
2006
116views more  PR 2006»
13 years 7 months ago
Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...
Stefano Rovetta, Francesco Masulli
PPSN
1994
Springer
13 years 11 months ago
A Representation Scheme To Perform Program Induction in a Canonical Genetic Algorithm
This paper studies Genetic Programming (GP) and its relation to the Genetic Algorithm (GA). GP uses a GA approach to breed successive populations of programs, represented in the ch...
Mark Wineberg, Franz Oppacher
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 7 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...
ESA
2000
Springer
141views Algorithms» more  ESA 2000»
13 years 11 months ago
Preemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
Han Hoogeveen, Martin Skutella, Gerhard J. Woeging...