4377 search results - page 317 / 876 » Mass problems and randomness |
154
click to vote
ICALP
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
196
click to vote
RANDOM
1998
Springer
15 years 11 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
211
click to vote
FLAIRS
2007
15 years 9 months ago
2007
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
187
click to vote
SCAI
2008
15 years 8 months ago
2008
The problem of automatically selecting simulation models for autonomous agents depending on their current intentions and beliefs is considered in this paper. The intended use of t...
206
click to vote
BMVC
2010
15 years 4 months ago
2010
The problems of dense stereo reconstruction and object class segmentation can both be formulated as Conditional Random Field based labelling problems, in which every pixel in the ...