17541 search results - page 3299 / 3509 » Complexity in scalable computing |
153
click to vote
SIGCOMM
2004
ACM
15 years 9 months ago
2004
ACM
Hot-potato routing is a mechanism employed when there are multiple (equally good) interdomain routes available for a given destination. In this scenario, the Border Gateway Protoc...
141
click to vote
SIGECOM
2004
ACM
15 years 9 months ago
2004
ACM
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
130
click to vote
WMPI
2004
ACM
15 years 9 months ago
2004
ACM
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
135
click to vote
AMAI
2004
Springer
15 years 9 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
129
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....