Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...