Sciweavers

12 search results - page 1 / 3
» Annealing and the normalized N-cut
Sort
View
PR
2008
170views more  PR 2008»
13 years 3 months ago
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...
Tomás Gedeon, Albert E. Parker, Collette Ca...
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
13 years 9 months ago
Multi-niche crowding in the development of parallel genetic simulated annealing
In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from ...
Zhi-Gang Wang, Mustafizur Rahman 0002, Yoke-San Wo...
ICCV
1995
IEEE
13 years 7 months ago
Fast Object Recognition in Noisy Images Using Simulated Annealing
A fast simulatedannealingalgorithmis developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hy...
Margrit Betke, Nicholas C. Makris
KBSE
2007
IEEE
13 years 10 months ago
The business case for automated software engineering
Adoption of advanced automated SE (ASE) tools would be favored if a business case could be made that these tools are more valuable than alternate methods. In theory, software pred...
Tim Menzies, Oussama El-Rawas, Jairus Hihn, Martin...
SIBGRAPI
1999
IEEE
13 years 8 months ago
Piecewise Trilinear Deformation of Tomographic Models
: In this work we introduce an iterative method that deforms brain models built from tomographic images. The deformation is used for normalization purposes: individual models are d...
Sílvio de Barros Melo