Sciweavers

2434 search results - page 151 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
163
Voted
MOR
2000
162views more  MOR 2000»
15 years 3 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
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...
Alok Baveja, Aravind Srinivasan
132
Voted
MICCAI
2008
Springer
16 years 5 months ago
Evaluation of a Cardiac Ultrasound Segmentation Algorithm Using a Phantom
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...
116
Voted
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
15 years 7 months ago
Intelligent Recombination Using Individual Learning in a Collective Learning Genetic Algorithm
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...
Terry P. Riopka, Peter Bock
158
Voted
JGO
2011
165views more  JGO 2011»
14 years 6 months ago
A biased random-key genetic algorithm for routing and wavelength assignment
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...
135
Voted
ESA
2008
Springer
81views Algorithms» more  ESA 2008»
15 years 5 months ago
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
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...
Pankaj K. Agarwal, Jeff M. Phillips