696 search results - page 64 / 140 » A class of combinatorial identities |
153
click to vote
JCO
2010
15 years 1 months ago
2010
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
108
click to vote
TCOM
2010
15 years 1 months ago
2010
In this paper, we propose a novel class of unitary space-time constellations based on quaternary quasi-orthogonal sequences (QOSs), minimizing the maximum correlation between the s...
191
click to vote
WINE
2010
Springer
15 years 4 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 ...
156
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
193
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...