Sciweavers

1301 search results - page 223 / 261
» Bounded Version Vectors
Sort
View
NEUROSCIENCE
2001
Springer
14 years 2 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
COCO
2000
Springer
65views Algorithms» more  COCO 2000»
14 years 2 months ago
On the Complexity of Quantum ACC
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
FOCS
1998
IEEE
14 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ROBOCUP
1999
Springer
115views Robotics» more  ROBOCUP 1999»
14 years 2 months ago
UBU Team
The underlying research topics and the architecture of the UBU team are briefly described. The aim of developing UBU is to subject a series of tools and procedures for agent decis...
Johan Kummeneje, David Lybäck, Håkan L....
KDD
1998
ACM
129views Data Mining» more  KDD 1998»
14 years 2 months ago
Data Reduction Based on Hyper Relations
Data reduction makes datasets smaller but preserves classication structures of interest. It is an important area of research in data mining and databases. In this paper we present...
Hui Wang, Ivo Düntsch, David A. Bell