1329 search results - page 78 / 266 » Models and solution techniques for frequency assignment prob... |
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
Automatically assigning keywords to images is of great interest as it allows one to index, retrieve, and understand large collections of image data. Many techniques have been propo...
119
click to vote
EH
2002
IEEE
15 years 8 months ago
2002
IEEE
Evolutionary algorithms (EAs) are regularly used both for the solution of scheduling problems, and for the creation of digital circuit designs. This paper describes a unified app...
129
click to vote
JMLR
2006
15 years 2 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
125
click to vote
ISLPED
2007
ACM
15 years 4 months ago
2007
ACM
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
113
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
: Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimizatio...