Sciweavers

3049 search results - page 169 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
KI
2006
Springer
15 years 6 months ago
A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
Rüdiger Ebendt, Rolf Drechsler
TEC
2002
117views more  TEC 2002»
15 years 6 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
HIPC
2003
Springer
15 years 11 months ago
A Parallel Iterative Improvement Stable Matching Algorithm
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
Enyue Lu, S. Q. Zheng

Publication
767views
17 years 4 months ago
Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks
Congestion avoidance mechanisms allow a network to operate in the optimal region of low delay and high throughput, thereby, preventing the network from becoming congested. This is ...
D. Chiu and R. Jain
TMI
2010
156views more  TMI 2010»
15 years 1 months ago
Snakules: A Model-Based Active Contour Algorithm for the Annotation of Spicules on Mammography
Abstract--We have developed a novel, model-based active contour algorithm, termed "snakules", for the annotation of spicules on mammography. At each suspect spiculated ma...
Gautam S. Muralidhar, Alan Conrad Bovik, J. David ...