Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
This paper evaluates the performance of a level set algorithm for segmenting the endocardium in short-axis ultrasound images. The evaluation is carried out using an anthropomorphic...
Yong Yue, Hemant D. Tagare, Ernest L. Madsen, G...
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength...
Thiago F. Noronha, Mauricio G. C. Resende, Celso C...
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...