Sciweavers

1120 search results - page 125 / 224
» Parallel Algorithmic Techniques for Combinatorial Computatio...
Sort
View
HPCC
2007
Springer
14 years 3 months ago
A Complex Network-Based Approach for Job Scheduling in Grid Environments
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
Renato Porfirio Ishii, Rodrigo Fernandes de Mello,...
TASLP
2010
148views more  TASLP 2010»
13 years 3 months ago
Batch and Adaptive PARAFAC-Based Blind Separation of Convolutive Speech Mixtures
We present a frequency-domain technique based on PARAllel FACtor (PARAFAC) analysis that performs multichannel blind source separation (BSS) of convolutive speech mixtures. PARAFAC...
Dimitri Nion, Kleanthis N. Mokios, Nicholas D. Sid...
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
14 years 3 months ago
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Core...
SPAA
2004
ACM
14 years 2 months ago
Balanced graph partitioning
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
Konstantin Andreev, Harald Räcke
IPPS
1996
IEEE
14 years 1 months ago
Generic Methodologies for Deadlock-Free Routing
This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic depen...
Hyunmin Park, Dharma P. Agrawal