8540 search results - page 416 / 1708 » The Dynamic Servers Problem |
150
click to vote
NIPS
2001
15 years 6 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
155
click to vote
ICST
2011
IEEE
14 years 8 months ago
2011
IEEE
—A known problem of traditional coverage metrics is that they do not assess oracle quality—that is, whether the computation result is actually checked against expectations. In ...
140
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
160
click to vote
CVIU
2008
15 years 4 months ago
2008
A key problem in video content analysis using dynamic graphical models is to learn a suitable model structure given some observed visual data. We propose a Completed Likelihood AI...
183
click to vote
EC
2008
15 years 4 months ago
2008
In recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants...