Sciweavers

9176 search results - page 347 / 1836
» algorithms 2010
Sort
View
JMLR
2010
102views more  JMLR 2010»
15 years 1 months ago
Discover Local Causal Network around a Target to a Given Depth
For a given target node T and a given depth k 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents,...
You Zhou, Changzhang Wang, Jianxin Yin, Zhi Geng
CEC
2010
IEEE
15 years 7 months ago
Two-stage based ensemble optimization for large-scale global optimization
Large-scale global optimization (LSGO) is a very important and challenging task in optimization domain, which is embedded in many scientific and engineering applications. In this p...
Yu Wang, Bin Li
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
15 years 6 months ago
Computing the Greedy Spanner in Near-Quadratic Time
It is well-known that the greedy algorithm produces high quality spanners and therefore is used in several applications. However, for points in d-dimensional Euclidean space, the g...
Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil M...
EOR
2010
110views more  EOR 2010»
15 years 6 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
EOR
2002
125views more  EOR 2002»
15 years 6 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz