Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...
In this paper we introduce a new view on roles in Object Oriented programming languages, based on an ontological analysis of roles. A role is always associated with an object inst...
Matteo Baldoni, Guido Boella, Leendert W. N. van d...
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
The elastic-mode formulation of the problem of minimizing a nonlinear function subject to equilibrium constraints has appealing local properties in that, for a finite value of the...