4894 search results - page 510 / 979 » The Guarding Problem - Complexity and Approximation |
129
Voted
CJ
1999
15 years 4 months ago
1999
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
141
click to vote
Publication
Image matching has been a central research topic in computer vision over the last decades. Typical approaches for correspondence involve matching features between images. In this p...
118
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
125
click to vote
SIAMAM
2010
15 years 3 months ago
2010
We present a mathematical framework for the so-called multidisciplinary free material optimization (MDFMO) problems, a branch of structural optimization in which the full material ...
158
click to vote
FLAIRS
2010
15 years 2 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...