40 search results - page 2 / 8 » New techniques for cost sharing in combinatorial optimizatio... |
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on...
WABI
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper, we use integer programming approach for solving a hard combinatorial optimization problem, namely protein threading. For this sequence-to-structure alignme...
AAAI
2004
13 years 6 months ago
2004
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
AAAI
2006
13 years 6 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
DATE
2000
IEEE
13 years 9 months ago
2000
IEEE
Embedded systems make a heavy use of software to perform Real-Time embedded control tasks. Embedded software is characterized by a relatively long lifetime and by tight cost, perf...