Sciweavers

Share
CORR
2002
Springer
99views Education» more  CORR 2002»
8 years 9 months ago
Nonmonotonic inference operations
A. Tarski 21] proposed the study of in nitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations...
Michael Freund, Daniel J. Lehmann
CORR
2002
Springer
92views Education» more  CORR 2002»
8 years 9 months ago
Neutrality: A Necessity for Self-Adaptation
Self-adaptation is used in all main paradigms of evolutionary computation to increase efficiency. We claim that the basis of self-adaptation is the use of neutrality. In the absenc...
Marc Toussaint, Christian Igel
CORR
2002
Springer
100views Education» more  CORR 2002»
8 years 9 months ago
A neural model for multi-expert architectures
We present a generalization of conventional artificial neural networks that allows for a functional equivalence to multi-expert systems. The new model provides an architectural fr...
Marc Toussaint
CORR
2002
Springer
106views Education» more  CORR 2002»
8 years 9 months ago
On model selection and the disability of neural networks to decompose tasks
A neural network with fixed topology can be regarded as a parametrization of functions, which decides on the correlations between functional variations when parameters are adapted...
Marc Toussaint
CORR
2002
Springer
135views Education» more  CORR 2002»
8 years 9 months ago
An Architecture for Making Object-Oriented Systems Available from Prolog
It is next to impossible to develop real-life applications in just pure Prolog. With XPCE [5] we realised a mechanism for integrating Prolog with an external object-oriented syste...
Jan Wielemaker, Anjo Anjewierden
CORR
2002
Springer
99views Education» more  CORR 2002»
8 years 9 months ago
Intersection Types and Lambda Theories
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of -theories. Relying on the notion of easy intersection type theory we succes...
Mariangiola Dezani-Ciancaglini, Stefania Lusin
CORR
2002
Springer
166views Education» more  CORR 2002»
8 years 9 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
CORR
2002
Springer
76views Education» more  CORR 2002»
8 years 9 months ago
Quantum Zero-Error Algorithms Cannot be Composed
Harry Buhrman, Ronald de Wolf
CORR
2002
Springer
102views Education» more  CORR 2002»
8 years 9 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
CORR
2002
Springer
101views Education» more  CORR 2002»
8 years 9 months ago
Quantum Circuits with Unbounded Fan-out
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
Peter Høyer, Robert Spalek
books