1702 search results - page 67 / 341 » Doomed program points |
142
click to vote
SAS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and e...
130
click to vote
ECCC
2007
15 years 4 months ago
2007
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to sh...
137
click to vote
SIAMJO
2008
15 years 4 months ago
2008
It is known that the Karush-Kuhn-Tucker (KKT) conditions of semidefinite programming can be reformulated as a nonsmooth system via the metric projector over the cone of symmetric ...
122
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--Intervals are a new model for parallel programming based on an explicit happens before relation. Intervals permit fine-grained but high-level control of the program sched...
141
click to vote
MP
2010
14 years 11 months ago
2010
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minima...