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...
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 ...
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...
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...
: 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...