1263 search results - page 167 / 253 » A* with Bounded Costs |
PODC
2004
ACM
14 years 2 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
CGO
2003
IEEE
14 years 2 months ago
2003
IEEE
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
SPAA
2003
ACM
14 years 2 months ago
2003
ACM
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
SAC
2000
ACM
14 years 1 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
ICMCS
1999
IEEE
14 years 1 months ago
1999
IEEE
In this paper, we propose a buffer cache algorithm to build a cost effective storage server for real time news objects. In a News On Demand Server, the number of concurrent stream...