2647 search results - page 61 / 530 » Solving Term Inequalities |
110
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...
121
click to vote
AUTOMATICA
2002
15 years 3 months ago
2002
We present a method for estimating the domain of attraction of the origin for a system under a saturated linear feedback. A simple condition is derived in terms of an auxiliary fe...
111
Voted
QUESTA
2008
15 years 3 months ago
2008
To obtain insight in the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number of waiting customers in an M/D/s queue as s . I...
154
Voted
DBPL
1997
Springer
15 years 8 months ago
1997
Springer
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...
133
click to vote
IOR
2006
15 years 3 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...