4266 search results - page 72 / 854 » The container loading problem |
147
Voted
DAM
2008
15 years 5 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
121
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we complete the construction of paper [9, 11]. Together with the proof contained in [9, 11], this paper definitely proves that the general problem of tiling the hy...
159
Voted
STOC
1997
ACM
15 years 10 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
150
Voted
SAC
2008
ACM
15 years 5 months ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
162
Voted
SC
1995
ACM
15 years 9 months ago
1995
ACM
The problem of determining the evolutionary history of species in the form of phylogenetic trees is known as the phylogeny problem. We present a parallelization of the character c...