10890 search results - page 1831 / 2178 » Automatic Complexity Analysis |
163
Voted
SIGECOM
2005
ACM
16 years 6 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
159
click to vote
SIGECOM
2005
ACM
16 years 6 days ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
173
click to vote
SPAA
2005
ACM
16 years 6 days ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
193
click to vote
WOSP
2005
ACM
16 years 6 days ago
2005
ACM
Recently, growing attention is focused on run-time management of Quality of Service (QoS) of complex software systems. In this context, self-adaptation of applications, based on r...
178
click to vote
ADAEUROPE
2005
Springer
16 years 6 days ago
2005
Springer
This paper describes the design and implementation of GNAT Pro for ERC32, a flexible cross-development environment supporting the Ravenscar tasking model on top of bare ERC32 comp...