Sciweavers

2899 search results - page 73 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
NAACL
2010
14 years 11 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
15 years 5 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
PPSN
2000
Springer
15 years 5 months ago
Practical Implications of New Results in Conservation of Optimizer Performance
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
Thomas M. English
DAGM
2003
Springer
15 years 6 months ago
Partial Optimal Labeling Search for a NP-Hard Subclass of (max, +) Problems
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of th...
Ivan Kovtun
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
15 years 5 months ago
A new generation alternation model for differential evolution
We present a modified version of Differential Evolution (DE) for locating the global minimum at a higher convergence velocity. The proposed model differs from conventional DE by a...
Nasimul Noman, Hitoshi Iba