Sciweavers

614 search results - page 77 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
SIGECOM
2009
ACM
110views ECommerce» more  SIGECOM 2009»
15 years 4 months ago
On random sampling auctions for digital goods
In the context of auctions for digital goods, an interesting Random Sampling Optimal Price auction (RSOP) has been proposed by Goldberg, Hartline and Wright; this leads to a truth...
Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasa...
JAIR
2008
103views more  JAIR 2008»
14 years 10 months ago
ICE: An Expressive Iterative Combinatorial Exchange
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
Benjamin Lubin, Adam I. Juda, Ruggiero Cavallo, S&...
FSTTCS
2010
Springer
14 years 8 months ago
Generalized Mean-payoff and Energy Games
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objectiv...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
MFCS
2004
Springer
15 years 3 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
ICLP
1997
Springer
15 years 2 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...