Sciweavers

1972 search results - page 217 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
135
Voted
IJCNN
2006
IEEE
15 years 10 months ago
Cellular SRN Trained by Extended Kalman Filter Shows Promise for ADP
— Cellular simultaneous recurrent neural network has been suggested to be a function approximator more powerful than the MLP’s, in particular for solving approximate dynamic pr...
Roman Ilin, Robert Kozma, Paul J. Werbos
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 4 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
148
Voted
DISOPT
2008
89views more  DISOPT 2008»
15 years 3 months ago
Group sequencing around a common due date
The problem of scheduling groups of jobs on a single machine under the group technology assumption is studied. Jobs of the same group are processed contiguously and a sequence ind...
T. C. Edwin Cheng, Mikhail Y. Kovalyov, C. T. Ng, ...
WCET
2010
15 years 2 months ago
Precomputing Memory Locations for Parametric Allocations
Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictability of cache performance introduc...
Jörg Herter, Sebastian Altmeyer
PEPM
2011
ACM
14 years 7 months ago
Allocation removal by partial evaluation in a tracing JIT
The performance of many dynamic language implementations suffers from high allocation rates and runtime type checks. This makes dynamic languages less applicable to purely algorit...
Carl Friedrich Bolz, Antonio Cuni, Maciej FijaBkow...