Sciweavers

840 search results - page 32 / 168
» Inapproximability of Combinatorial Optimization Problems
Sort
View
AAAI
2004
14 years 10 days ago
Methods for Boosting Revenue in Combinatorial Auctions
We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pu...
Anton Likhodedov, Tuomas Sandholm
PAMI
2010
245views more  PAMI 2010»
13 years 9 months ago
A Combinatorial Solution for Model-Based Image Segmentation and Real-Time Tracking
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
Thomas Schoenemann, Daniel Cremers
CEC
2010
IEEE
14 years 1 days ago
Local Optima Networks of the Quadratic Assignment Problem
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
Fabio Daolio, Sébastien Vérel, Gabri...
IAT
2007
IEEE
14 years 5 months ago
Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling
We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resource...
Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, J...
AAAI
2000
14 years 9 days ago
An Algorithm for Multi-Unit Combinatorial Auctions
We present a novel algorithm for computing the optimal winning bids in a combinatorial auction (CA), that is, an auction in which bidders bid for bundles of goods. All previously ...
Kevin Leyton-Brown, Yoav Shoham, Moshe Tennenholtz