416 search results - page 4 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
SODA
2008
ACM
13 years 7 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
IAT
2006
IEEE
13 years 11 months ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
SODA
2004
ACM
13 years 7 months ago
2004
ACM
srn.com/abstract=423560
CEC
2007
IEEE
14 years 3 days ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
COCO
1994
Springer
13 years 10 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...