Sciweavers

353 search results - page 68 / 71
» Better Scripts, Better Games
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ICC
2007
IEEE
239views Communications» more  ICC 2007»
14 years 2 months ago
Measuring WCDMA and HSDPA Delay Characteristics with QoSMeT
—Quality of Service (QoS) is becoming increasingly important with the rise of multimedia applications (e.g., voice over IP (VoIP), video conferencing, online gaming, and Internet...
Jarmo Prokkola, Mikko Hanski, Marko Jurvansuu, Mil...
MM
2005
ACM
118views Multimedia» more  MM 2005»
14 years 1 months ago
Supporting multi-party voice-over-IP services with peer-to-peer stream processing
Multi-party voice-over-IP (MVoIP) services provide economical and natural group communication mechanisms for many emerging applications such as on-line gaming, distance collaborat...
Xiaohui Gu, Zhen Wen, Philip S. Yu, Zon-Yin Shae
AMEC
2004
Springer
14 years 1 months ago
A Budget-Balanced, Incentive-Compatible Scheme for Social Choice
Abstract. Many practical scenarios involve solving a social choice problem: a group of self-interested agents have to agree on an outcome that best fits their combined preferences...
Boi Faltings
SIGECOM
2010
ACM
125views ECommerce» more  SIGECOM 2010»
14 years 1 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...