Sciweavers

1074 search results - page 89 / 215
» Parallelizing post-placement timing optimization
Sort
View
JAIR
1998
81views more  JAIR 1998»
13 years 8 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
IEEEINTERACT
2003
IEEE
14 years 2 months ago
Procedure Cloning and Integration for Converting Parallelism from Coarse to Fine Grain
This paper introduces a method for improving program run-time performance by gathering work in an application and executing it efficiently in an integrated thread. Our methods ext...
Won So, Alexander G. Dean
GECCO
2003
Springer
108views Optimization» more  GECCO 2003»
14 years 2 months ago
Implicit Parallelism
This paper assumes a search space of fixed-length strings, where the size of the alphabet can vary from position to position. Structural crossover is mask-based crossover, and thu...
Alden H. Wright, Michael D. Vose, Jonathan E. Rowe
ESWA
2008
162views more  ESWA 2008»
13 years 9 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
JACM
2012
11 years 11 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang