696 search results - page 50 / 140 » A class of combinatorial identities |
143
click to vote
DM
2008
15 years 6 months ago
2008
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cycli...
155
click to vote
DM
1998
15 years 5 months ago
1998
We introduce three deÿnitions of q-analogs of Motzkin numbers and illustrate some combinatorial interpretations of these q-numbers. We relate the ÿrst class of q-numbers to the ...
193
click to vote
SWAT
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
147
click to vote
ANOR
2011
15 years 1 months ago
2011
Abstract The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, br...
194
click to vote
DM
2011
14 years 9 months ago
2011
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...