4843 search results - page 287 / 969 » The Shortcut Problem - Complexity and Approximation |
123
click to vote
RTCSA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— Time-critical jobs in many real-time applications have multiple feasible intervals. Such a job is constrained to execute from start to completion in one of its feasible...
130
click to vote
AUSAI
2005
Springer
15 years 9 months ago
2005
Springer
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
128
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
111
click to vote
ALT
2010
Springer
15 years 5 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...
123
Voted
NIPS
2004
15 years 5 months ago
2004
We propose a novel a framework for deriving approximations for intractable probabilistic models. This framework is based on a free energy (negative log marginal likelihood) and ca...