5550 search results - page 222 / 1110 » Different Approaches to Proof Systems |
146
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
147
click to vote
WSC
2004
15 years 8 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...
172
click to vote
MOR
2008
15 years 6 months ago
2008
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was sh...
186
click to vote
LOGCOM
1998
15 years 6 months ago
1998
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
144
click to vote
IPL
2010
15 years 5 months ago
2010
In this paper, we re-analyse the Rate Monotonic Scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all t...