1332 search results - page 96 / 267 » Combinatorial Algorithms |
ANTSW
2006
Springer
14 years 28 days ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
JMLR
2008
13 years 9 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
WINE
2010
Springer
13 years 7 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
DCG
2010
13 years 7 months ago
2010
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...