Sciweavers

33356 search results - page 6353 / 6672
» Models of Continual Computation
Sort
View
279
Voted
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 10 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 10 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 10 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
181
Voted
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
15 years 10 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
CASES
2007
ACM
15 years 10 months ago
Rethinking custom ISE identification: a new processor-agnostic method
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
Ajay K. Verma, Philip Brisk, Paolo Ienne
« Prev « First page 6353 / 6672 Last » Next »