We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, writte...
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
This paper discusses Curry’s work on how to implement the problem of inverse interpolation on the ENIAC (1946) and his subsequent work on developing a theory of program compositi...
Liesbeth De Mol, Maarten Bullynck, Martin Carl&eac...
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
Wei Chen, Dayu Huang, Ankur A. Kulkarni, Jayakrish...
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...