Sciweavers

21324 search results - page 4199 / 4265
» Making the case for computing
Sort
View
POPL
1995
ACM
15 years 1 months ago
Monad Transformers and Modular Interpreters
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
Sheng Liang, Paul Hudak, Mark P. Jones
COCO
1991
Springer
93views Algorithms» more  COCO 1991»
15 years 1 months ago
Relating Equivalence and Reducibility to Sparse Sets
For various polynomial-time reducibilities r, this paper asks whether being r-reducible to a sparse set is a broader notion than being r-equivalent to a sparse set. Although distin...
Eric Allender, Lane A. Hemachandra, Mitsunori Ogiw...
GECCO
2010
Springer
192views Optimization» more  GECCO 2010»
15 years 1 months ago
Resource abundance promotes the evolution of public goods cooperation
Understanding the evolution of cooperation as part of an evolutionary stable strategy (ESS) is a difficult problem that has been the focus of much work. The associated costs of co...
Brian D. Connelly, Benjamin E. Beckmann, Philip K....
AAAI
2008
15 years 3 days ago
A Theory of Expressiveness in Mechanisms
A key trend in (electronic) commerce is a demand for higher levels of expressiveness in the mechanisms that mediate interactions. We develop a theory that ties the expressiveness ...
Michael Benisch, Norman M. Sadeh, Tuomas Sandholm
AAAI
2007
15 years 3 days ago
Automated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tu...
« Prev « First page 4199 / 4265 Last » Next »