3250 search results - page 363 / 650 » Parameterized Learning Complexity |
182
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...
139
Voted
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
164
click to vote
KBSE
2000
IEEE
15 years 8 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
159
click to vote
NIPS
2003
15 years 6 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
181
click to vote
SPRINGSIM
2007
15 years 5 months ago
2007
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...