1647 search results - page 122 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
173
click to vote
EWSN
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
183
click to vote
ICALP
1991
Springer
15 years 8 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
153
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
215
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
151
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...