14774 search results - page 2878 / 2955 » Computational complexity and evolutionary computation |
179
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
162
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
169
click to vote
COLT
1993
Springer
15 years 8 months ago
1993
Springer
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...
203
click to vote
AII
1992
15 years 8 months ago
1992
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 ...
134
click to vote
ISER
1993
Springer
15 years 8 months ago
1993
Springer
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...