727 search results - page 44 / 146 » Private approximation of search problems |
109
click to vote
CORR
2007
Springer
15 years 18 days ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
103
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
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...
92
Voted
SPIRE
1999
Springer
15 years 4 months ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
105
click to vote
UAI
2001
15 years 2 months ago
2001
We propose a new approach to value-directed belief state approximationfor POMDPs. The valuedirected model allows one to choose approximation methods for belief state monitoringtha...
100
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...