3221 search results - page 146 / 645 » Termination of Linear Programs |
ENTCS
2008
13 years 9 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...
ISQED
2007
IEEE
14 years 4 months ago
2007
IEEE
In this paper, we propose a new approach to enforcing the passivity of a reduced system of general passive linear time invariant circuits. Instead of making the reduced models pas...
ICDE
1991
IEEE
14 years 1 months ago
1991
IEEE
— Constraints play an important role in the efficient query evaluation in deductive databases. In this paper, constraint-based query evaluation in deductive databases is investi...
IWMM
2004
Springer
14 years 3 months ago
2004
Springer
Operating systems account for memory consumption and allow for termination at the level of individual processes. As a result, if one process consumes too much memory, it can be te...