4066 search results - page 719 / 814 » Almost Complete Sets |
COR
2007
13 years 9 months ago
2007
We present a framework for solving multistage pure 0–1 programs for a widely used sequencing and scheduling problem with uncertainty in the objective function coefficients, the...
COR
2008
13 years 9 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
ENTCS
2008
13 years 9 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
MSCS
2007
13 years 9 months ago
2007
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...