Sciweavers

3250 search results - page 447 / 650
» An Algorithm to Solve a Linear Program
Sort
View
GECCO
2008
Springer
182views Optimization» more  GECCO 2008»
15 years 7 months ago
Scaling ant colony optimization with hierarchical reinforcement learning partitioning
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
Erik J. Dries, Gilbert L. Peterson
ICNP
2002
IEEE
15 years 11 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
ICASSP
2010
IEEE
15 years 6 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
GLVLSI
2011
IEEE
351views VLSI» more  GLVLSI 2011»
14 years 10 months ago
Design of low-power multiple constant multiplications using low-complexity minimum depth operations
Existing optimization algorithms for the multiplierless realization of multiple constant multiplications (MCM) typically target the minimization of the number of addition and subt...
Levent Aksoy, Eduardo Costa, Paulo F. Flores, Jos&...
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
15 years 10 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian