Sciweavers

696 search results - page 4 / 140
» A class of combinatorial identities
Sort
View
TEC
2002
101views more  TEC 2002»
14 years 9 months ago
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
This paper proposes a novel evolutionary algorithm inspired by quantum computing, called a quantum-inspired evolutionary algorithm (QEA), which is based on the concept and principl...
Kuk-Hyun Han, Jong-Hwan Kim
DM
2000
64views more  DM 2000»
14 years 9 months ago
Size functions of subgeometry-closed classes of representable combinatorial geometries
Let exq(G; n) be the maximum number of points in a rank-n geometry (simple matroid) that is representable over GF(q) and that has no restriction isomorphic to the geometry G. We fi...
Joseph E. Bonin, Hongxun Qin
92
Voted
JCT
2008
78views more  JCT 2008»
14 years 9 months ago
A partition bijection related to the Rogers-Selberg identities and Gordon's theorem
We provide a bijective map from the partitions enumerated by the series side of the Rogers-Selberg mod 7 identities onto partitions associated with a special case of Basil Gordon&...
Andrew V. Sills
103
Voted
JCT
2011
90views more  JCT 2011»
14 years 4 months ago
Extended Bressoud-Wei and Koike skew Schur function identities
Our recent paper [5] provides extensions to two classical determinantal results of Bressoud and Wei, and of Koike. The proofs in that paper were algebraic. The present paper conta...
A. M. Hamel, R. C. King
SEW
2006
IEEE
15 years 3 months ago
Pseudo-Exhaustive Testing for Software
Pseudo-exhaustive testing uses the empirical observation that, for broad classes of software, a fault is likely triggered by only a few variables interacting. The method takes adv...
D. Richard Kuhn, Vadim Okun