Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

EVOW
2010
Springer

favoriteEmaildiscussreport

163views Artificial Intelligence» more EVOW 2010»

Memory Design for Constrained Dynamic Optimization Problems

13 years 9 months ago

Memory Design for Constrained Dynamic Optimization Problems

Download www.fbeit.htwk-leipzig.de

A proposal for a memory design is given that is suitable for solving constrained dynamic optimization problems by an evolutionary m. Based on ideas from abstract memory, two schemes, blending and censoring, are introduced and tested. Using a new benchmark we show in numerical experiments that such a memory can improve solving certain types of constrained dynamic problems.

Hendrik Richter

Real-time Traffic

Abstract Memory | Artificial Intelligence | Constrained Dynamic Optimization | Constrained Dynamic Problems | EVOW 2010 |

claim paper

Related Content

» Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal applicatio...

» Dynamic Degree Constrained Network Design A Genetic Algorithm Approach

» On the Feedback Capacity of Power Constrained Gaussian Noise Channels with Memory

» Benchmarking and solving dynamic constrained problems

» Studying StorageRecomputation Tradeoffs in MemoryConstrained Embedded Processing

» Optimal Design of Shape Memory Alloy Wire Bundle Actuators

» Reducing Memory Fragmentation with PerformanceOptimized Dynamic Memory Allocators in Netwo...

» Chance constrained programming approach to process optimization under uncertainty

» Reducing memory fragmentation in network applications with dynamic memory allocators optim...

Post Info
More Details (n/a)

Added	09 Jul 2010
Updated	09 Jul 2010
Type	Conference
Year	2010
Where	EVOW
Authors	Hendrik Richter

Comments (0)