1445 search results - page 22 / 289 » Uniformly Hard Languages |
107
click to vote
TREC
2004
15 years 1 months ago
2004
UIUC participated in the HARD track in TREC 2004 and focused on the evaluation of a new method for identifying variable-length passages using HMMs. Most existing approaches to pas...
STOC
2009
ACM
16 years 12 days ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
SBCCI
2004
ACM
15 years 5 months ago
2004
ACM
Software synthesis is defined as the task of translating a specification into a software program, in a general purpose language, in such a way that this software can be compiled...
106
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
DATE
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled u...