1142 search results - page 134 / 229 » Set Variables and Local Search |
121
Voted
CICLING
2003
Springer
15 years 8 months ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
123
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
124
Voted
FLAIRS
2007
15 years 5 months ago
2007
Discovery of graphical models is NP-hard in general, which justifies using heuristics. We consider four commonly used heuristics. We summarize the underlying assumptions and anal...
126
Voted
CEC
2010
IEEE
15 years 3 months ago
2010
IEEE
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
115
click to vote
EOR
2010
15 years 3 months ago
2010
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...