377 search results - page 8 / 76 » A Value Theory of Meta-Learning Algorithms |
RTSS
2002
IEEE
15 years 2 months ago
2002
IEEE
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
KDD
2005
ACM
15 years 10 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
71
Voted
CIE
2010
Springer
15 years 1 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
81
Voted
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Decentralised coordination in multi-agent systems is typically achieved using communication. However, in many cases, communication is expensive to utilise because there is limited...
107
click to vote
SCALESPACE
2007
Springer
15 years 3 months ago
2007
Springer
On March 11, 1944, the famous Eremitani Church in Padua (Italy) was destroyed in an Allied bombing along with the inestimable frescoes by Andrea Mantegna et al. contained in the Ov...