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...
—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...
In this paper, some experiences of using the concurrent functional language Erlang to implement a classical vertical application, a risk management information system, are present...
David Cabrero, Carlos Abalde, Carlos Varela, Laura...
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...
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...