1647 search results - page 159 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
150
click to vote
ICCAD
1993
IEEE
15 years 9 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
150
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
152
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
133
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
192
Voted
WADS
2007
Springer
15 years 11 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...