Sciweavers

4469 search results - page 253 / 894
» Dynamic Program Slicing
Sort
View
WICON
2008
13 years 9 months ago
Programming in mobile ad hoc networks
The possibility for spontaneous ad hoc networks between mobile devices has been increasing as small devices become more capable of hosting useful networked applications. These app...
Justin Collins, Rajive Bagrodia
ICGA
1993
145views Optimization» more  ICGA 1993»
13 years 9 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»
13 years 8 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»
13 years 8 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»
13 years 6 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