1204 search results - page 73 / 241 » Termination of Polynomial Programs |
194
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
We develop a model of concurrent imperative programming with threads. We focus on a small imperative language with cooperative threads which execute without interruption until the...
109
Voted
APAQS
2001
IEEE
15 years 4 months ago
2001
IEEE
Infinite looping is a common type of program error. This paper studies the detection of infinite loops in imperative programs. A sufficient condition is given, which is based on p...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
86
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
116
Voted
SAC
2000
ACM
15 years 5 months ago
2000
ACM
The mobility of terminals and users is a crucial issue in the open global system represented by the Internet. Supporting terminal and user mobility requires a middleware infrastru...