Sciweavers

2183 search results - page 320 / 437
» Generating Parallel Algorithms for Cluster and Grid Computin...
Sort
View
ICDCS
2009
IEEE
15 years 7 months ago
On the Impossibility of Maximal Scheduling for Strong Fairness with Interleaving
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
Matthew Lang, Paolo A. G. Sivilotti
SI3D
2009
ACM
15 years 2 months ago
Screen space fluid rendering with curvature flow
We present an approach for rendering the surface of particle-based fluids that is simple to implement, has real-time performance with a configurable speed/quality trade-off, and...
Wladimir J. van der Laan, Simon Green, Miguel Sain...
GECCO
2005
Springer
135views Optimization» more  GECCO 2005»
15 years 3 months ago
Parameter sweeps for exploring GP parameters
This paper describes our procedure and a software application for conducting large parameter sweep experiments in genetic and evolutionary computation research. Both procedure and...
Michael E. Samples, Jason M. Daida, Matthew J. Byo...
GECCO
2008
Springer
182views Optimization» more  GECCO 2008»
14 years 11 months ago
Scaling ant colony optimization with hierarchical reinforcement learning partitioning
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
Erik J. Dries, Gilbert L. Peterson
ISPDC
2006
IEEE
15 years 3 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun