Sciweavers

632 search results - page 88 / 127
» Explicit Substitutions and Programming Languages
Sort
View
AI
2002
Springer
13 years 7 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
IFL
2003
Springer
14 years 24 days ago
Dynamic Chunking in Eden
Parallel programming generally requires awareness of the granularity and communication requirements of parallel subtasks, since without precaution, the overhead for parameter and r...
Jost Berthold
SAC
1998
ACM
13 years 12 months ago
Open, distributed coordination with finesse
Coordination languages have recently been attracting signi cant attention as a means of programming parallel and distributed systems. The approach of separating coordination from ...
Andrew Berry, Simon M. Kaplan
CSL
2004
Springer
13 years 11 months ago
A Functional Scenario for Bytecode Verification of Resource Bounds
We consider a scenario where (functional) programs in pre-compiled form are exchanged among untrusted parties. Our contribution is a system of annotations for the code that can be ...
Roberto M. Amadio, Solange Coupet-Grimal, Silvano ...
IWMM
2000
Springer
78views Hardware» more  IWMM 2000»
13 years 11 months ago
On the Type Accuracy of Garbage Collection
We describe a novel approach to obtaining type-accurate information for garbage collection in a hardware and language independent way. Our approach uses a run-time analysis to pro...
Martin Hirzel, Amer Diwan