8647 search results - page 560 / 1730 » The Container Selection Problem |
183
Voted
COMBINATORICS
2006
15 years 7 months ago
2006
This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncro...
151
Voted
DAM
2006
15 years 7 months ago
2006
Given n clones with some positive ones, the problem of DNA screening is to identify all positive clones with a set of tests each on a subset of clones, called a pool and the outco...
189
click to vote
IJFCS
2008
15 years 7 months ago
2008
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
202
click to vote
JCT
2006
15 years 7 months ago
2006
Eroh and Oellermann defined BRR(G1, G2) as the smallest N such that any edge coloring of the complete bipartite graph KN,N contains either a monochromatic G1 or a multicolored G2....
171
click to vote
IGPL
2007
15 years 7 months ago
2007
This work studies the structure of proofs containing non-analytic cuts in the cut-based system, a sequent inference system in which the cut rule is not eliminable and the only bra...