Sciweavers

14699 search results - page 2860 / 2940
» Complexity and Cognitive Computing
Sort
View
COLT
1993
Springer
14 years 1 days ago
Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized by Real Numbers
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
Paul W. Goldberg, Mark Jerrum
AII
1992
14 years 1 days ago
Learning from Multiple Sources of Inaccurate Data
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
Ganesh Baliga, Sanjay Jain, Arun Sharma
ISER
1993
Springer
141views Robotics» more  ISER 1993»
14 years 1 days ago
Experimental Integration of Planning in a Distributed Control System
This paper describes a complete system architecture integrating planning into a two-armed robotic workcell. The system is comprised of four major components: user interface, plann...
Gerardo Pardo-Castellote, Tsai-Yen Li, Yoshihito K...
POPL
1994
ACM
14 years 20 hour ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
POPL
1989
ACM
13 years 12 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
« Prev « First page 2860 / 2940 Last » Next »