2976 search results - page 142 / 596 » On the bounded integer programming |
OOPSLA
2010
Springer
15 years 1 months ago
2010
Springer
The act of computer programming is generally considered to be temporally removed from a computer program’s execution. In this paper we discuss the idea of programming as an acti...
114
click to vote
PLDI
2010
ACM
16 years 9 days ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
114
click to vote
TCS
2008
15 years 2 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
126
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
125
click to vote
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
The interaction among concurrently executing threads of a program results in insidious programming errors that are difficult to reproduce and fix. Unfortunately, the problem of ve...