4377 search results - page 55 / 876 » Mass problems and randomness |
177
Voted
ESA
2011
Springer
14 years 4 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
155
click to vote
ISCC
2006
IEEE
15 years 10 months ago
2006
IEEE
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
174
click to vote
PODS
2012
ACM
13 years 6 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
126
click to vote
MDAI
2009
Springer
15 years 11 months ago
2009
Springer
We propose a means of extending Conditional Random Field modeling to decision-theoretic planning where valuation is dependent upon fullyobservable factors. Representation is discu...
111
click to vote
PR
2008
15 years 4 months ago
2008
In this paper, we present a new background estimation algorithm which effectively represents both background and foreground. The problem is formulated with a labeling problem over...