1450 search results - page 150 / 290 » On the Complexity of Hardness Amplification |
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In constraint programming there are often many choices regarding the propagation method to be used on the constraints of a problem. However, simple constraint solvers usu...
EUROGP
2009
Springer
14 years 3 months ago
2009
Springer
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in GP from the perspec...
KI
2009
Springer
14 years 3 months ago
2009
Springer
Spoken dialogue is notoriously hard to process with standard language processing technologies. Dialogue systems must indeed meet two major challenges. First, natural spoken dialogu...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
ISSTA
2009
ACM
14 years 3 months ago
2009
ACM
During testing, the execution of valid cases is only one part of the task. Checking the behavior in boundary situations and in the presence of errors is an equally important subje...