Sciweavers

43264 search results - page 8380 / 8653
» Comparing models of computation
Sort
View
DBPL
1993
Springer
89views Database» more  DBPL 1993»
15 years 3 months ago
Database Programming in Transaction Logic
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
Anthony J. Bonner, Michael Kifer, Mariano P. Conse...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 3 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
FPCA
1989
15 years 3 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
MFPS
1989
15 years 3 months ago
Operations on Records
We define a simple collection of operations for creating and manipulating record structures, where records are intended as finite associations of values to labels. A second-order ...
Luca Cardelli, John C. Mitchell
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
15 years 3 months ago
Asymptotically optimal repeated auctions for sponsored search
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
Nicolas S. Lambert, Yoav Shoham
« Prev « First page 8380 / 8653 Last » Next »