4894 search results - page 852 / 979 » The Guarding Problem - Complexity and Approximation |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
Genetic programming has been considered a promising approach for function approximation since it is possible to optimize both the functional form and the coefficients. However, it...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
APLAS
2003
ACM
13 years 11 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
RSCTC
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...