924 search results - page 126 / 185 » A Probabilistic Approach to Language Change |
169
click to vote
AADEBUG
2005
Springer
15 years 10 months ago
2005
Springer
Debugging techniques have evolved over the years in response to changes in programming languages, implementation techniques, and user needs. A new type of implementation vehicle f...
163
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
143
click to vote
SIAMCOMP
1998
15 years 4 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...
132
click to vote
AIIA
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we compare four selection strategies in evolutionary optimization of information retrieval (IR) in a question answering setting. The IR index has been augmented by li...
161
click to vote
ICFCA
2005
Springer
15 years 10 months ago
2005
Springer
A key difficulty in the maintenance and evolution of complex software systems is to recognize and understand the implicit dependencies that define contracts that must be respecte...