Sciweavers

866 search results - page 57 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
138
Voted
DAC
1989
ACM
15 years 7 months ago
Scheduling and Binding Algorithms for High-Level Synthesis
- New algorithms for high-level synthesis are presented. The first performs scheduling under hardware resource constraints and improves on commonly used list scheduling techniques ...
Pierre G. Paulin, John P. Knight
113
Voted
COR
2008
118views more  COR 2008»
15 years 3 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
143
Voted
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
15 years 3 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis
152
Voted
SPDP
1991
IEEE
15 years 7 months ago
Asynchronous parallel search by the parallel genetic algorithm
The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete proble...
Heinz Mühlenbein
120
Voted
ESCIENCE
2007
IEEE
15 years 10 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...