Sciweavers

2657 search results - page 362 / 532
» On the complexity of hierarchical problem solving
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Fast inference and learning in large-state-space HMMs
For Hidden Markov Models (HMMs) with fully connected transition models, the three fundamental problems of evaluating the likelihood of an observation sequence, estimating an optim...
Sajid M. Siddiqi, Andrew W. Moore
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 7 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
CEC
2008
IEEE
16 years 1 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
CEC
2007
IEEE
16 years 1 months ago
A study on the design issues of Memetic Algorithm
— Over the recent years, there has been increasing research activities made on improving the efficacy of Memetic Algorithm (MA) for solving complex optimization problems. Partic...
Q. H. Nguyen, Yew-Soon Ong, Natalio Krasnogor
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
16 years 1 months ago
Adaptive genetic programming for option pricing
Genetic Programming (GP) is an automated computational programming methodology, inspired by the workings of natural evolution techniques. It has been applied to solve complex prob...
Zheng Yin, Anthony Brabazon, Conall O'Sullivan