Sciweavers

2609 search results - page 306 / 522
» Models for Global Constraint Applications
Sort
View
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
15 years 9 months ago
Are Multiple Runs of Genetic Algorithms Better than One?
Abstract. There are conflicting reports over whether multiple independent runs of genetic algorithms (GAs) with small populations can reach solutions of higher quality or can fin...
Erick Cantú-Paz, David E. Goldberg
ISLPED
2009
ACM
108views Hardware» more  ISLPED 2009»
15 years 9 months ago
Technology flavor selection and adaptive techniques for timing-constrained 45nm subthreshold circuits
We investigate techniques to design 45nm minimum-energy subthreshold CMOS circuits under timing constraints, considering the practical case of an 8-bit multiplier. We first show ...
David Bol, Denis Flandre, Jean-Didier Legat
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 9 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
ASPLOS
1992
ACM
15 years 8 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
ATAL
2006
Springer
15 years 8 months ago
Adaptive distributed resource allocation and diagnostics using cooperative information-sharing strategies
A major challenge in efficiently solving distributed resource allocation problems is to cope with the dynamic state changes that characterise such systems. An effective solution t...
Partha Sarathi Dutta, Nicholas R. Jennings, Luc Mo...