787 search results - page 126 / 158 » Polynomial Constants are Decidable |
ANOR
2005
13 years 9 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
JGT
2007
13 years 9 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
SIAMCOMP
2000
13 years 9 months ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
SIAMCO
2002
13 years 9 months ago
2002
This paper deals with linear shift-invariant distributed systems. By this we mean systems described by constant coefficient linear partial differential equations. We define dissipa...
ACTA
2008
13 years 8 months ago
2008
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...