1263 search results - page 32 / 253 » A* with Bounded Costs |
129
click to vote
WINE
2010
Springer
14 years 7 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
WDAG
2007
Springer
15 years 3 months ago
2007
Springer
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
SIGECOM
2005
ACM
15 years 3 months 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...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
NETWORKING
2008
14 years 11 months ago
2008
We study distributed content replication networks formed voluntarily by selfish autonomous users, seeking access to information objects that originate from distant servers. Each us...