Sciweavers

11949 search results - page 2187 / 2390
» Some results on (a:b)-choosability
Sort
View
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
15 years 6 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
SIGECOM
2010
ACM
125views ECommerce» more  SIGECOM 2010»
15 years 6 months ago
Information asymmetries in pay-per-bid auctions
Recently, some mainstream e-commerce web sites have begun using “pay-per-bid” auctions to sell items, from video games to bars of gold. In these auctions, bidders incur a cost...
John W. Byers, Michael Mitzenmacher, Georgios Zerv...
SIGECOM
2010
ACM
154views ECommerce» more  SIGECOM 2010»
15 years 6 months ago
Ranking games that have competitiveness-based strategies
This paper studies —from the perspective of efficient computation— a type of competition that is widespread throughout the plant and animal kingdoms, higher education, politic...
Leslie Ann Goldberg, Paul W. Goldberg, Piotr Kryst...
SIGMOD
2010
ACM
231views Database» more  SIGMOD 2010»
15 years 6 months ago
Automatically incorporating new sources in keyword search-based data integration
Scientific data offers some of the most interesting challenges in data integration today. Scientific fields evolve rapidly and accumulate masses of observational and experiment...
Partha Pratim Talukdar, Zachary G. Ives, Fernando ...
SPAA
2010
ACM
15 years 6 months ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc
« Prev « First page 2187 / 2390 Last » Next »