406 search results - page 48 / 82 » Identifying Codes and Covering Problems |
104
click to vote
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
SIAMCOMP
1998
14 years 9 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
ACMSE
2004
ACM
15 years 1 months ago
2004
ACM
Over the past decade, the need to build secure software has become a dominant goal in software development. Consequently, software researchers and practitioners have identified wa...
SAS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
IJIT
2004
14 years 11 months ago
2004
A sequential decision problem, based on the task of identifying the species of trees given acoustic echo data collected from them, is considered with well-known stochastic classifi...