Sciweavers

464 search results - page 3 / 93
» Memory Based on Abstraction for Dynamic Fitness Functions
Sort
View
AINA
2009
IEEE
14 years 1 days ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
EVOW
2010
Springer
13 years 10 months ago
Memory Design for Constrained Dynamic Optimization Problems
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 scheme...
Hendrik Richter
FPL
2000
Springer
115views Hardware» more  FPL 2000»
13 years 8 months ago
Efficient Self-Reconfigurable Implementations Using On-chip Memory
abstract the dynamic nature of a computation to embedded data memory (which is accessible on-chip). The dynamic nature of a computation corresponds to the dynamic features of its i...
Sameer Wadhwa, Andreas Dandalis
EVOW
2008
Springer
13 years 7 months ago
A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
Gregory J. Barlow, Stephen F. Smith
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
13 years 8 months ago
A genetic model based on simulated crossover of quaternary genes for quadratic fitness
We present a genetic model based on simulated recombination of fixed sequences of quaternary genes (assuming four distinct forms, or alleles). States and dynamics of the infinite ...
Marco Carpentieri, Vito Fedullo