Sciweavers

134 search results - page 3 / 27
» An Optimal Rebuilding Strategy for an Incremental Tree Probl...
Sort
View
DOLAP
2005
ACM
13 years 7 months ago
Optimizing the incremental maintenance of multiple join views
Materialized views are nowadays commonly used in the data warehouse environment. Materialized views need to be updated when data sources change. Since the update of the views may ...
Ki Yong Lee, Myoung-Ho Kim
CP
2008
Springer
13 years 6 months ago
Exploiting Decomposition in Constraint Optimization Problems
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
Matthew Kitching, Fahiem Bacchus
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
ICML
2006
IEEE
14 years 5 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
PAKDD
2007
ACM
203views Data Mining» more  PAKDD 2007»
13 years 11 months ago
Grammar Guided Genetic Programming for Flexible Neural Trees Optimization
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
Peng Wu, Yuehui Chen