Sciweavers

7978 search results - page 249 / 1596
» Combining shared-coin algorithms
Sort
View
AAAI
2000
15 years 5 months ago
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NP-complete...
Tuomas Sandholm, Subhash Suri
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 5 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
CORR
2008
Springer
114views Education» more  CORR 2008»
15 years 4 months ago
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
Nir Ailon
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
15 years 4 months ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
16 years 4 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic