1274 search results - page 18 / 255 » New Proofs for |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
nd Counterexample-Based Abstraction Niklas Een, Alan Mishchenko EECS Department, University of California Berkeley, USA. Nina Amla Cadence Research Laboratroy Berkeley, USA. This p...
TCS
2011
13 years 2 months ago
2011
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
IPL
2007
13 years 7 months ago
2007
The MIN algorithm is an offline strategy for deciding which item to replace when writing a new item to a cache. Its optimality was first established by Mattson, Gecsei, Slutz, a...
HIP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we propose a new class of Human Interactive Proofs (HIPs) that allow a human to distinguish one computer from another. Unlike traditional HIPs, where the computer is...
CG
2006
Springer
13 years 11 months ago
2006
Springer
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...