976 search results - page 25 / 196 » The Complexity of Timetable Construction Problems |
104
click to vote
TCAD
2008
14 years 11 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
DAM
2002
14 years 11 months ago
2002
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
ECCC
2002
14 years 11 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
CLASSIFICATION
2006
14 years 12 months ago
2006
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
ISTA
2007
15 years 1 months ago
2007
: The article is devoted to the development of knowledge-oriented models that are able to increase the efficiency and quality of main pipeline complex (MPC) dispatching control. Th...