28962 search results - page 5524 / 5793 » Computational Mechanism Design |
200
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
179
click to vote
SPAA
2004
ACM
16 years 3 days ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
197
click to vote
BIRTHDAY
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. A long-running transaction is an interactive component of a distributed system which must be executed as if it were a single atomic action. In principle, it should not be...
163
click to vote
DRM
2004
Springer
16 years 2 days ago
2004
Springer
The current landscape for digital rights management (DRM) consists of various ad hoc technologies and platforms that largely focus on copy protection. The fragmented nature of the...
192
click to vote
EMSOFT
2004
Springer
16 years 2 days ago
2004
Springer
Embedded devices like smart cards can now run multiple interacting applications. A particular challenge in this domain is to dynamically integrate diverse security policies. In th...