Sciweavers

4894 search results - page 261 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
16 years 1 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
FOCS
2008
IEEE
16 years 1 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
SAC
2006
ACM
16 years 17 days ago
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situat...
Alexandre Goldsztejn
VLBV
2005
Springer
16 years 2 days ago
Efficient Digital Pre-filtering for Least-Squares Linear Approximation
In this paper we propose a very simple FIR pre-filter based method for near optimal least-squares linear approximation of discrete time signals. A digital pre-processing filter,...
Marco Dalai, Riccardo Leonardi, Pierangelo Miglior...
SMI
2003
IEEE
142views Image Analysis» more  SMI 2003»
15 years 12 months ago
Approximate Congruence Detection of Model Features for Reverse Engineering
Reverse engineering allows the geometric reconstruction of simple mechanical parts. However, the resulting models suffer from inaccuracies caused by errors in measurement and reco...
C. H. Gao, Frank C. Langbein, A. David Marshall, R...