Sciweavers

376 search results - page 11 / 76
» Developing Theories of Types and Computability via Realizabi...
Sort
View
FOCS
1998
IEEE
13 years 11 months ago
A Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...
John C. Mitchell, Mark Mitchell, Andre Scedrov
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 11 months ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing
COGSR
2010
74views more  COGSR 2010»
13 years 2 months ago
Two qubits for C.G. Jung's theory of personality
We propose a formalization of C.G. Jung's theory of personality using a four-dimensional Hilbert-space for the representation of two qubits. The first qubit relates to Jung&#...
Reinhard Blutner, Elena Hochnadel
ITICSE
2004
ACM
14 years 27 days ago
Generation as method for explorative learning in computer science education
The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advant...
Andreas Kerren
ICCAD
1999
IEEE
101views Hardware» more  ICCAD 1999»
13 years 11 months ago
Efficient model reduction of interconnect via approximate system gramians
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
Jing-Rebecca Li, Jacob White