In bioinformatics, biochemical pathways can be modeled by many differential equations. It is still an open problem how to fit the huge amount of parameters of the equations to the...
Abstract. Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search spac...
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Abstract. In our research we are studying how to combine modelling, metamodelling, and reflection to systematically generate middleware configurations that can be targeted at diffe...
Nelly Bencomo, Gordon S. Blair, Geoff Coulson, Tha...
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...