Sciweavers

2814 search results - page 42 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
AAAI
2006
13 years 11 months ago
Analysis of Privacy Loss in Distributed Constraint Optimization
Distributed Constraint Optimization (DCOP) is rapidly emerging as a prominent technique for multiagent coordination. However, despite agent privacy being a key motivation for appl...
Rachel Greenstadt, Jonathan P. Pearce, Milind Tamb...
ATAL
2009
Springer
14 years 4 months ago
Pick-a-bundle: a novel bundling strategy for selling multiple items within online auctions
In this paper, we consider the design of an agent that is able to autonomously make optimal bundling decisions when selling multiple heterogeneous items within existing online auc...
Ioannis A. Vetsikas, Alex Rogers, Nicholas R. Jenn...
CSCLP
2004
Springer
14 years 3 months ago
A Value Ordering Heuristic for Local Search in Distributed Resource Allocation
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
Adrian Petcu, Boi Faltings
IPL
2008
114views more  IPL 2008»
13 years 10 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
14 years 2 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo