Sciweavers

85 search results - page 3 / 17
» On Approximating Real-World Halting Problems
Sort
View
CP
2005
Springer
14 years 1 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
11 years 10 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
AGI
2008
13 years 9 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov
JDA
2007
97views more  JDA 2007»
13 years 7 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
GECCO
2008
Springer
177views Optimization» more  GECCO 2008»
13 years 8 months ago
Reduced computation for evolutionary optimization in noisy environment
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
Maumita Bhattacharya