Sciweavers

14518 search results - page 222 / 2904
» Two Problems for Sophistication
Sort
View
95
Voted
IEAAIE
2005
Springer
15 years 6 months ago
Structural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...
James Montgomery, Marcus Randall, Tim Hendtlass
MFCS
2005
Springer
15 years 6 months ago
Tight Approximability Results for the Maximum Solution Equation Problem over Zp
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...
Fredrik Kuivinen
ICCAD
1999
IEEE
132views Hardware» more  ICCAD 1999»
15 years 5 months ago
The associative-skew clock routing problem
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
Yu Chen, Andrew B. Kahng, Gang Qu, Alexander Zelik...
83
Voted
EURODAC
1994
IEEE
186views VHDL» more  EURODAC 1994»
15 years 4 months ago
Algorithms for a switch module routing problem
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
Shashidhar Thakur, D. F. Wong, S. Muthukrishnan
EUROGP
2007
Springer
145views Optimization» more  EUROGP 2007»
15 years 4 months ago
GP Classifier Problem Decomposition Using First-Price and Second-Price Auctions
This work details an auction-based model for problem decomposition in Genetic Programming classification. The approach builds on the population-based methodology of Genetic Progra...
Peter Lichodzijewski, Malcolm I. Heywood