Sciweavers

4266 search results - page 299 / 854
» The container loading problem
Sort
View
JCT
2006
168views more  JCT 2006»
15 years 4 months ago
Mono-multi bipartite Ramsey numbers, designs, and matrices
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....
Paul N. Balister, András Gyárf&aacut...
IGPL
2007
107views more  IGPL 2007»
15 years 4 months ago
Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs
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...
Marcelo Finger, Dov M. Gabbay
SIGACT
2008
103views more  SIGACT 2008»
15 years 4 months ago
Computational geometry column 50
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
Joseph O'Rourke
TOPLAS
2008
78views more  TOPLAS 2008»
15 years 4 months ago
The pitfalls of verifying floating-point computations
Current critical systems often use a lot of floating-point computations, and thus the testing or static analysis of programs containing floatingpoint operators has become a priori...
David Monniaux
BIOINFORMATICS
2004
59views more  BIOINFORMATICS 2004»
15 years 4 months ago
Efficient selection of unique and popular oligos for large EST databases
EST databases have grown exponentially in recent years and now represent the largest collection of genetic sequences. An important application of these databases is that they conta...
Jie Zheng, Timothy J. Close, Tao Jiang, Stefano Lo...