Sciweavers

598 search results - page 30 / 120
» A Deterministic Metaheuristic Approach Using
Sort
View
ESCIENCE
2007
IEEE
14 years 2 months ago
A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
Mustafizur Rahman 0003, Srikumar Venugopal, Rajkum...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
A memetic algorithm for the low autocorrelation binary sequence problem
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
JGO
2010
121views more  JGO 2010»
13 years 6 months ago
The oracle penalty method
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
Martin Schlüter, Matthias Gerdts
PPSN
2010
Springer
13 years 6 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
AAAI
1996
13 years 9 months ago
On the Range of Applicability of Baker's Approach to the Frame Problem
We investigate the range of applicability of Baker's approach to the frame problem using an action language. We show that for temporal projection and deterministic domains, B...
G. Neelakantan Kartha