Sciweavers

2078 search results - page 259 / 416
» MetaCores: Design and Optimization Techniques
Sort
View
CC
2004
Springer
15 years 3 months ago
Using Multiple Memory Access Instructions for Reducing Code Size
An important issue in embedded systems design is the size of programs. As computing devices decrease in size, yet with more and more functions, better code size optimizations are i...
Neil Johnson, Alan Mycroft
CONEXT
2007
ACM
15 years 1 months ago
Rethinking internet traffic management: from multiple decompositions to a practical protocol
In the Internet today, traffic management spans congestion control (at end hosts), routing protocols (on routers), and traffic engineering (by network operators). Historically, th...
Jiayue He, Martin Suchara, Ma'ayan Bresler, Jennif...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
Combining simplex with niche-based evolutionary computation for job-shop scheduling
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
Syhlin Kuah, Joc Cing Tay
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 1 months ago
Domain Knowledge and Representation in Genetic Algorithms for Real World Scheduling Problems
This paper discusses the issues that arise in the design and implementation of an industrialstrength evolutionary-based system for the optimization of the monthly work schedules f...
Ioannis T. Christou, Armand Zakarian
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
14 years 11 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre