1450 search results - page 158 / 290 » On the Complexity of Hardness Amplification |
SCIA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper deals, for the first time, with an analysis of localization capabilities of weakly supervised categorization systems. Most existing categorization approaches ...
TACAS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
HIPC
2004
Springer
14 years 2 months ago
2004
Springer
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
MFCS
2004
Springer
14 years 2 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...