Sciweavers

484 search results - page 66 / 97
» Computing Hilbert Class Polynomials
Sort
View
AAAI
1996
13 years 10 months ago
Learning to Take Actions
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
Roni Khardon
DEDS
2010
88views more  DEDS 2010»
13 years 8 months ago
On the Performance Evaluation of Multi-Guarded Marked Graphs with Single-Server Semantics
In discrete event systems, a given task can start executing when all the required input data are available. The required input data for a given task may change along the evolution...
Jorge Júlvez, Jordi Cortadella, Michael Kis...
AMC
2006
79views more  AMC 2006»
13 years 8 months ago
Church's thesis meets the N-body problem
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
Warren D. Smith
CORR
2000
Springer
134views Education» more  CORR 2000»
13 years 8 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
CDC
2009
IEEE
109views Control Systems» more  CDC 2009»
13 years 6 months ago
Exact solution for the max-min quantum error recovery problem
This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel...
Naoki Yamamoto