Sciweavers

4110 search results - page 199 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
IPPS
1998
IEEE
15 years 10 months ago
Benchmarking the Task Graph Scheduling Algorithms
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
Yu-Kwong Kwok, Ishfaq Ahmad
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 10 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
APIN
2000
120views more  APIN 2000»
15 years 6 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
SRDS
1998
IEEE
15 years 10 months ago
A Data Allocation Algorithm for Distributed Hypermedia Documents
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different site...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem
JMLR
2010
128views more  JMLR 2010»
15 years 1 months ago
Optimal Allocation Strategies for the Dark Pool Problem
We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuousvalued allocations are allowed. We also propose a...
Alekh Agarwal, Peter L. Bartlett, Max Dama