3946 search results - page 632 / 790 » The computational complexity of choice sets |
183
click to vote
ATAL
2005
Springer
16 years 3 days ago
2005
Springer
This paper develops a model for exceptions and an approach for incorporating them in commitment protocols among autonomous agents. Modeling and handling exceptions is critical for...
211
click to vote
MMB
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
208
click to vote
NEUROSCIENCE
2001
Springer
15 years 11 months ago
2001
Springer
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...
202
click to vote
UAI
2008
15 years 8 months ago
2008
Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3 ) scaling in computational time to O(nm2 ). Thus far, wo...
158
click to vote
ISMB
1997
15 years 7 months ago
1997
We are building a knowledge base (KB) of published structural data on the 30s ribosomal subunit in prokaryotes. Our KB is distinguished by a standardized representation of biologi...