Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
: Implementing binary methods in traditional object-oriented languages is difficult: numerous problems arise regarding the relationship between types and classes in the context of ...
Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be de...
Abstract. We analyze the so-called the minimal dissipation local discontinuous Galerkin method for convection-diffusion or diffusion problems. The distinctive feature of this met...
The explosive growth in genomic (and soon, expression and proteomic) data, exemplified by the Human Genome Project, is a fertile domain for the application of multi-agent informat...
Keith Decker, Salim Khan, Carl Schmidt, Gang Situ,...