921 search results - page 79 / 185 » Expressing Computational Complexity in Constructive Type The... |
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
IJON
2007
13 years 7 months ago
2007
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
COGSCI
2008
13 years 8 months ago
2008
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
HRI
2009
ACM
14 years 2 months ago
2009
ACM
This paper explores the use of an outcome matrix as a computational representation of social interaction suitable for implementation on a robot. An outcome matrix expresses the re...