5647 search results - page 905 / 1130 » A word from the editor |
159
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
165
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
148
click to vote
CSDA
2004
15 years 6 months ago
2004
Various exact tests for showing a difference between two treatments or the noninferiority (therapeutic equivalence) based on the difference of two binomial proportions are compare...
143
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
198
click to vote
APIN
2000
15 years 6 months ago
2000
Abstract. This paper addresses several issues related to the use of conceptual modeling to support serviceoriented, advanced information systems. It shows how conceptual modeling o...