Sciweavers

975 search results - page 84 / 195
» Locality Optimization for Program Instances
Sort
View
JGO
2010
117views more  JGO 2010»
13 years 8 months ago
Machine learning problems from optimization perspective
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
Lei Xu
CP
2001
Springer
14 years 2 months ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
13 years 9 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
CEC
2009
IEEE
14 years 4 months ago
Performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC09 test problems
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
Santosh Tiwari, Georges Fadel, Patrick Koch, Kalya...
WEA
2007
Springer
158views Algorithms» more  WEA 2007»
14 years 3 months ago
A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
Markus Behle, Michael Jünger, Frauke Liers