Sciweavers

2244 search results - page 170 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
SIGMOD
1995
ACM
116views Database» more  SIGMOD 1995»
15 years 10 months ago
Incremental Maintenance of Views with Duplicates
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
Timothy Griffin, Leonid Libkin
ECAI
2010
Springer
15 years 7 months ago
Brothers in Arms? On AI Planning and Cellular Automata
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
Jörg Hoffmann, Nazim Fatès, Héc...
TCBB
2008
122views more  TCBB 2008»
15 years 7 months ago
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ra...
CEC
2010
IEEE
14 years 10 months ago
Evoptool: An extensible toolkit for evolutionary optimization algorithms comparison
— This paper presents Evolutionary Optimization Tool (Evoptool), an optimization toolkit that implements a set of meta-heuristics based on the Evolutionary Computation paradigm. ...
Gabriele Valentini, Luigi Malagò, Matteo Ma...
IANDC
2006
86views more  IANDC 2006»
15 years 7 months ago
Table design in dynamic programming
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
Peter Steffen, Robert Giegerich