Sciweavers

107 search results - page 6 / 22
» Dynamic Management of Heuristics for Solving Structured CSPs
Sort
View
CORR
2008
Springer
153views Education» more  CORR 2008»
13 years 8 months ago
Decomposition Techniques for Subgraph Matching
In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For suc...
Stéphane Zampelli, Martin Mann, Yves Devill...
GECCO
2010
Springer
170views Optimization» more  GECCO 2010»
14 years 19 days ago
Improving reliability of embedded systems through dynamic memory manager optimization using grammatical evolution
Technology scaling has offered advantages to embedded systems, such as increased performance, more available memory and reduced energy consumption. However, scaling also brings a...
José Manuel Colmenar, José L. Risco-...
GECCO
2009
Springer
193views Optimization» more  GECCO 2009»
14 years 14 days ago
Optimization of dynamic memory managers for embedded systems using grammatical evolution
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
José L. Risco-Martín, David Atienza,...
COR
2002
95views more  COR 2002»
13 years 7 months ago
Dynamic lot sizing and tool management in automated manufacturing systems
The overall aim of this study is to show that there is a critical interface between the lot sizing and tool management decisions, and these two problems cannot be viewed in isolat...
M. Selim Akturk, Siraceddin Onen
WSC
2008
13 years 10 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell