Sciweavers

1653 search results - page 289 / 331
» Computer science and game theory
Sort
View
TOMACS
2011
139views more  TOMACS 2011»
13 years 3 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
ICS
2010
Tsinghua U.
14 years 6 months ago
Robustly Leveraging Collusion in Combinatorial Auctions
feuse of its devstting eets in utions nd other mehnismsD ollusion is prohiited nd leglly proseutedF etD olluders hve lwys existedD nd my ontinue to existF e thus rise the followin...
Jing Chen, Silvio Micali, Paul Valiant
FOCS
2008
IEEE
14 years 3 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
14 years 9 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
SDM
2009
SIAM
112views Data Mining» more  SDM 2009»
14 years 6 months ago
A Re-evaluation of the Over-Searching Phenomenon in Inductive Rule Learning.
Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluat...
Frederik Janssen, Johannes Fürnkranz