Sciweavers

725 search results - page 93 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
AISC
2006
Springer
13 years 11 months ago
Finding Relations Among Linear Constraints
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
Jun Yan, Jian Zhang, Zhongxing Xu
EGITALY
2006
13 years 9 months ago
SVG Vectorization by Statistical Region Merging
In this paper a novel algorithm for raster to vector conversion is presented. The technique is mainly devoted to vectorize digital picture maintaining an high degree of photoreali...
Sebastiano Battiato, Giovanni Maria Farinella, Gio...
HIS
2003
13 years 9 months ago
On the Performance of Ant-based Clustering
Ant-based clustering and sorting is a nature-inspired heuristic for general clustering tasks. It has been applied variously, from problems arising in commerce, to circuit design, t...
Julia Handl, Joshua D. Knowles, Marco Dorigo
EOR
2008
200views more  EOR 2008»
13 years 7 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
COMCOM
2006
75views more  COMCOM 2006»
13 years 7 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari