Sciweavers

7303 search results - page 212 / 1461
» Optimality for dynamic patterns
Sort
View
143
Voted
GECCO
2003
Springer
163views Optimization» more  GECCO 2003»
15 years 8 months ago
Swarms in Dynamic Environments
Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achie...
T. M. Blackwell
111
Voted
EVOW
2009
Springer
15 years 10 months ago
Dynamic Time-Linkage Problems Revisited
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
Trung Thanh Nguyen, Xin Yao
ISIPTA
2003
IEEE
117views Mathematics» more  ISIPTA 2003»
15 years 8 months ago
Dynamic Programming for Discrete-Time Systems with Uncertain Gain
We generalise the optimisation technique of dynamic programming for discretetime systems with an uncertain gain function. We assume that uncertainty about the gain function is des...
Gert de Cooman, Matthias C. M. Troffaes
112
Voted
AAAI
2008
15 years 5 months ago
Efficient Memoization for Dynamic Programming with Ad-Hoc Constraints
We address the problem of effective reuse of subproblem solutions in dynamic programming. In dynamic programming, a memoed solution of a subproblem can be reused for another if th...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu
141
Voted
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 3 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...