Sciweavers

5757 search results - page 411 / 1152
» Dynamic Policy Programming
Sort
View
ICGA
1993
145views Optimization» more  ICGA 1993»
15 years 8 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
ANOR
2007
67views more  ANOR 2007»
15 years 7 months ago
A stochastic programming model for asset liability management of a Finnish pension company
This paper describes a stochastic programming model that was developed for asset liability management of a Finnish pension insurance company. In many respects the model resembles t...
Petri Hilli, Matti Koivu, Teemu Pennanen, Antero R...
COGSCI
2004
97views more  COGSCI 2004»
15 years 6 months ago
A rhythm recognition computer program to advocate interactivist perception
This paper advocates the main ideas of the interactive model of representation of Mark Bickhard and the assimilation/accommodation framework of Jean Piaget, through a rhythm recog...
Jean-Christophe Buisson
DATESO
2009
101views Database» more  DATESO 2009»
15 years 4 months ago
Using Top Trees For Easy Programming of Tree Algorithms
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
Michal Vajbar
IOR
2010
98views more  IOR 2010»
15 years 4 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith