9626 search results - page 1620 / 1926 » Invariant Based Programming |
153
click to vote
FSTTCS
2007
Springer
16 years 25 days ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
172
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
153
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
The problem of how to acquire a model of a physical robot, which is fit for evolution of controllers that can subsequently be used to control that robot, is considered in the con...
178
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
182
click to vote
ICALP
2007
Springer
16 years 25 days ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...