Sciweavers

4759 search results - page 317 / 952
» Parallelizing the Phylogeny Problem
Sort
View
PPOPP
2005
ACM
16 years 7 days ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
IPPS
2009
IEEE
16 years 1 months ago
Combining multiple heuristics on discrete resources
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
Marin Bougeret, Pierre-François Dutot, Alfr...
IPPS
2007
IEEE
16 years 1 months ago
Message Routing and Scheduling in Optical Multistage Networks using Bayesian Inference method on AI algorithms
Optical Multistage Interconnection Networks (MINs) suffer from optical-loss during switching and crosstalk problem in the switches. The crosstalk problem is solved by routing mess...
Ajay K. Katangur, Somasheker Akkaladevi
IPPS
2006
IEEE
16 years 22 days ago
Compiler and runtime support for predictive control of power and cooling
The low cost of clusters built using commodity components has made it possible for many more users to purchase their own supercomputer. However, even modest-sized clusters make si...
Henry G. Dietz, William R. Dieter
170
Voted
PPSN
2004
Springer
16 years 1 days ago
Evolutionary Multi-agent Systems
In Multi-Agent learning, agents must learn to select actions that maximize their utility given the action choices of the other agents. Cooperative Coevolution offers a way to evol...
Pieter Jan't Hoen, Edwin D. de Jong