Sciweavers

125 search results - page 15 / 25
» Finding Skew Partitions Efficiently
Sort
View
EOR
2010
110views more  EOR 2010»
13 years 7 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
IVC
2008
203views more  IVC 2008»
13 years 7 months ago
Multi-modal tracking using texture changes
We present a method for efficiently generating a representation of a multi-modal posterior probability distribution. The technique combines ideas from RANSAC and particle filterin...
Christopher Kemp, Tom Drummond
KAIS
2008
99views more  KAIS 2008»
13 years 7 months ago
Privacy-preserving SVM classification
Classical data mining algorithms implicitly assume complete access to all data, either in centralized or federated form. However, privacy and security concerns often prevent sharin...
Jaideep Vaidya, Hwanjo Yu, Xiaoqian Jiang
EC
2008
153views ECommerce» more  EC 2008»
13 years 7 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
HIS
2009
13 years 5 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl