Sciweavers

14699 search results - page 2860 / 2940
» Complexity and Cognitive Computing
Sort
View
156
Voted
COLT
1993
Springer
15 years 6 months 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
183
Voted
AII
1992
15 years 6 months 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
119
Voted
ISER
1993
Springer
141views Robotics» more  ISER 1993»
15 years 6 months 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...
123
Voted
POPL
1994
ACM
15 years 6 months 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...
165
Voted
POPL
1989
ACM
15 years 6 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 »