8132 search results - page 287 / 1627 » Dependability, Abstraction, and Programming |
165
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
131
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
d Abstract) Christian Cachin1 , Jan Camenisch1 , Joe Kilian2 , and Joy M
173
click to vote
MP
2008
15 years 6 months ago
2008
Abstract We propose primal-dual path-following Mehrotra-type predictorcorrector methods for solving convex quadratic semidefinite programming (QSDP) problems of the form: minX{1 2 ...
188
click to vote
APLAS
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the
133
click to vote
SIAMJO
2010
15 years 1 months ago
2010
Abstract: In this paper, we study KKT optimality conditions for constrained nonlinear programming problems and strong and Mordukhovich stationarities for mathematical