Sciweavers

3946 search results - page 653 / 790
» The computational complexity of choice sets
Sort
View
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
FOSSACS
2010
Springer
16 years 1 months ago
Reachability Analysis of Communicating Pushdown Systems
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
Alexander Heußner, Jérôme Lerou...
CISS
2008
IEEE
16 years 1 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
IEEEPACT
2008
IEEE
16 years 28 days ago
Exploiting loop-dependent stream reuse for stream processors
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
Xuejun Yang, Ying Zhang, Jingling Xue, Ian Rogers,...
INFOCOM
2008
IEEE
16 years 28 days ago
End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
Xiaolu Zhang, Wenhua Jiao, Meixia Tao