Sciweavers

2899 search results - page 31 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
JCSS
2006
77views more  JCSS 2006»
15 years 1 months ago
Sequential predictions based on algorithmic complexity
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
Marcus Hutter
ICCAD
1995
IEEE
90views Hardware» more  ICCAD 1995»
15 years 4 months ago
An optimal algorithm for area minimization of slicing floorplans
The traditional algorithm of Stockmeyer for area minimization of slicing oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
Weiping Shi
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 1 months ago
Cost-based query optimization for complex pattern mining on multiple databases
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
Ruoming Jin, David Fuhry, Abdulkareem Alali
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
15 years 7 months ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer
GECCO
2005
Springer
288views Optimization» more  GECCO 2005»
15 years 6 months ago
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto