Sciweavers

1096 search results - page 53 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
EOR
2010
110views more  EOR 2010»
14 years 12 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
JMLR
2010
149views more  JMLR 2010»
14 years 6 months ago
Fast Committee-Based Structure Learning
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
Ernest Mwebaze, John A. Quinn
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
15 years 3 months ago
Improving EAs for Sequencing Problems
Sequencing problems have to be solved very often in VLSI CAD. To obtain results of high quality, Evolutionary Algorithms (EAs) have been successfully applied in many cases. Howeve...
Wolfgang Günther, Rolf Drechsler
IEEECIT
2010
IEEE
14 years 10 months ago
Parallel Best Neighborhood Matching Algorithm Implementation on GPU Platform
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Guangyong Zhang, Liqiang He, Yanyan Zhang
VLDB
2003
ACM
147views Database» more  VLDB 2003»
16 years 1 days ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...