447 search results - page 79 / 90 » Approximation Algorithms for the Discrete Time-Cost Tradeoff... |
CCE
2004
13 years 8 months ago
2004
A large number of problems in production planning and scheduling, location, transportation, finance, and engineering design require that decisions be made in the presence of uncer...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
GECCO
2006
Springer
14 years 3 days ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
ALGORITHMICA
2010
13 years 8 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...