4126 search results - page 541 / 826 » Set based logic programming |
121
Voted
PLDI
2010
ACM
16 years 27 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 ...
127
Voted
CGO
2003
IEEE
15 years 8 months ago
2003
IEEE
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...
115
Voted
FSTTCS
2008
Springer
15 years 4 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
147
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract We present the first method to handle curvature regularity in region-based image segmentation and inpainting that is independent of initialization. To this end we start f...
134
Voted
ICTAI
2003
IEEE
15 years 8 months ago
2003
IEEE
One of the main reasons behind unfruitful software development projects is that it is often too late to correct the problems by the time they are detected. It clearly indicates th...