1888 search results - page 113 / 378 » Proof theory and computational analysis |
215
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
176
click to vote
COMPGEOM
2009
ACM
16 years 27 days ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
145
click to vote
CONCUR
2006
Springer
15 years 10 months ago
2006
Springer
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...
158
click to vote
IJCAI
1989
15 years 7 months ago
1989
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
153
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
Performance analysis has many advantages in theory compared to simulation for the validation of complex embedded systems, but is rarely used in practice. To make analysis more att...