Sciweavers

15485 search results - page 413 / 3097
» Computing Optimal Subsets
Sort
View
ESCIENCE
2006
IEEE
16 years 26 days ago
Hybrid Particle Guide Selection Methods in Multi-Objective Particle Swarm Optimization
This paper presents quantitative comparison of the performance of different methods for selecting the guide particle for multi-objective particle swarm optimization (MOPSO). Two p...
David Ireland, Andrew Lewis, Sanaz Mostaghim, Junw...
RANDOM
1999
Springer
15 years 11 months ago
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
Seth Pettie, Vijaya Ramachandran
ECCV
2006
Springer
16 years 8 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
DCC
2001
IEEE
16 years 6 months ago
Binary Optimal Odd Formally Self-Dual Codes
In this paper, we study binary optimal odd formally self-dual codes. All optimal odd formally self-dual codes are classified for length up to 16. The highest minimum weight of any ...
Koichi Betsumiya, Masaaki Harada
IPPS
2007
IEEE
16 years 1 months ago
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov