1647 search results - page 73 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
132
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
120
click to vote
EURODAC
1994
IEEE
15 years 8 months ago
1994
IEEE
We consider a switch module routing problem for symmetric array FPGAs. The work is motivated by two applications. The rst is that of eciently evaluating switch module designs [8]...
146
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
147
click to vote
IJCNN
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— The incomplete information about the Web structure causes inaccurate results of various ranking algorithms. In this paper, we propose a solution to this problem by form...
168
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...