1647 search results - page 101 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
239
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
149
click to vote
NIPS
2008
15 years 6 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
122
click to vote
ICALP
2005
Springer
15 years 10 months 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...
132
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
We present discrete stochastic mathematical models for the growth curves of synchronous and asynchronous evolutionary algorithms with populations structured according to a random ...
119
click to vote
FLAIRS
2003
15 years 6 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...