1687 search results - page 305 / 338 » Light Functional Interpretation |
129
click to vote
CAV
1999
Springer
15 years 8 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
142
click to vote
SIGIR
2010
ACM
15 years 8 months ago
2010
ACM
Evaluation metrics play a critical role both in the context of comparative evaluation of the performance of retrieval systems and in the context of learning-to-rank (LTR) as objec...
175
Voted
FLOPS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Assertion-based contracts provide a powerful mechanism for stating invariants at module boundaries and for enforcing them uniformly. In 2002, Findler and Felleisen showed...
171
Voted
APCSAC
2001
IEEE
15 years 7 months ago
2001
IEEE
Java bytecodes can be executed with the following three methods: a Java interpretor running on a particular machine interprets bytecodes; a Just-In-Time (JIT) compiler translates ...
134
Voted
NIPS
2003
15 years 5 months ago
2003
Recent work has examined the estimation of models of stimulus-driven neural activity in which some linear filtering process is followed by a nonlinear, probabilistic spiking stag...