Sciweavers

4266 search results - page 841 / 854
» The container loading problem
Sort
View
SIAMCOMP
1998
114views more  SIAMCOMP 1998»
13 years 7 months ago
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
Stefan Felsner, Lorenz Wernisch
TAPOS
1998
93views more  TAPOS 1998»
13 years 7 months ago
Object Acquaintance Selection and Binding
Large object-oriented systems have, at least, four characteristics that complicate object communication, i.e the system is distributed and contains large numbers, e.g. thousands, ...
Jan Bosch
TRANSCI
1998
78views more  TRANSCI 1998»
13 years 7 months ago
Queue Spillovers in Transportation Networks with a Route Choice
This paper explores some of the traffic phenomena that arise when drivers have to navigate a network in which queues back up past diverge intersections. If a diverge provides two ...
Carlos F. Daganzo
SOFTWARE
2002
13 years 7 months ago
Temporal Probabilistic Concepts from Heterogeneous Data Sequences
We consider the problem of characterisation of sequences of heterogeneous symbolic data that arise from a common underlying temporal pattern. The data, which are subject to impreci...
Sally I. McClean, Bryan W. Scotney, Fiona Palmer
TCS
2002
13 years 7 months ago
Restriction categories I: categories of partial maps
Given a category with a stable system of monics, one can form the corresponding category of partial maps. To each map in this category there is, on the domain of the map, an assoc...
J. Robin B. Cockett, Stephen Lack