56 search results - page 4 / 12 » On the connections between PCTL and dynamic programming |
IWFM
1998
13 years 8 months ago
1998
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
ICGA
1993
13 years 8 months ago
1993
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...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
A coevolutionary competitive learning environment for two antagonistic agents is presented. The agents are controlled by a new kind of computational network based on a compartment...
ISAAC
2005
Springer
14 years 29 days ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
PPL
2008
13 years 7 months ago
2008
Parallel functional programs with implicit communication often generate purely hierarchical communication topologies during execution: communication only happens between parent an...