Sciweavers

8824 search results - page 226 / 1765
» On the Complexity of Real Functions
Sort
View
IAT
2008
IEEE
15 years 6 months ago
Scaling Up Multi-agent Reinforcement Learning in Complex Domains
TD-FALCON (Temporal Difference - Fusion Architecture for Learning, COgnition, and Navigation) is a class of self-organizing neural networks that incorporates Temporal Difference (...
Dan Xiao, Ah-Hwee Tan
FSTTCS
2005
Springer
16 years 3 days ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
UC
2005
Springer
16 years 1 days ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
15 years 10 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
APAL
2004
105views more  APAL 2004»
15 years 6 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek