16404 search results - page 784 / 3281 » A set coverage problem |
187
click to vote
EVOW
2005
Springer
16 years 1 months ago
2005
Springer
A hyperheuristic is a high level procedure which searches over a space of low level heuristics rather than directly over the space of problem solutions. The sequence of low level h...
232
click to vote
PCM
2004
Springer
16 years 26 days ago
2004
Springer
Abstract. Due to its great ability of conquering clutters, which is especially useful for high-dimensional tracking problems, particle filter becomes popular in the visual trackin...
191
click to vote
CP
2003
Springer
16 years 22 days ago
2003
Springer
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
201
click to vote
ICCBR
2003
Springer
16 years 21 days ago
2003
Springer
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
198
click to vote
FOCS
2000
IEEE
15 years 12 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...