Sciweavers

3206 search results - page 131 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
IPMI
2007
Springer
15 years 9 months ago
Segmentation of Sub-cortical Structures by the Graph-Shifts Algorithm
Abstract. We propose a novel algorithm called graph-shifts for performing image segmentation and labeling. This algorithm makes use of a dynamic hierarchical representation of the ...
Jason J. Corso, Zhuowen Tu, Alan L. Yuille, Arthur...
PE
2000
Springer
101views Optimization» more  PE 2000»
15 years 2 months ago
On the convergence of the power series algorithm
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
Gerard Hooghiemstra, Ger Koole
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 6 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
AAAI
2000
15 years 4 months ago
Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...
HIPC
2009
Springer
15 years 23 days ago
Improved opportunistic scheduling algorithms for WiMAX Mobile Multihop Relay networks
We investigate the problem of scheduling in OFDMbased multihop relay networks with special emphasis on IEEE 802.16j based WiMAX networks. In such networks, scheduling is the probl...
Srinath Narasimha, Krishna M. Sivalingam