62 search results - page 4 / 13 » The Ackermann functions are not optimal, but by how much |
AIPS
2006
13 years 7 months ago
2006
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
CVPR
2007
IEEE
14 years 7 months ago
2007
IEEE
Markov Random Field, or MRF, models are a powerful tool for modeling images. While much progress has been made in algorithms for inference in MRFs, learning the parameters of an M...
CVPR
2010
IEEE
13 years 10 months ago
2010
IEEE
Kernel methods provide an efficient mechanism to derive nonlinear algorithms. In classification problems as well as in feature extraction, kernel-based approaches map the original...
AI
2011
Springer
13 years 25 days ago
2011
Springer
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
RTSS
2005
IEEE
13 years 11 months ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...