Results 21 to 30 of about 4,198,145 (291)
Strictly strategy-proof auctions
A strictly strategy-proof mechanism is one that asks agents to use strictly dominant strategies. In the canonical one-dimensional mechanism design setting with private values, we show that strict strategy-proofness is equivalent to strict monotonicity ...
Escudé, Matteo, Sinander, Ludvig
core +1 more source
Managing Library Electronic Resources Using Google Sites [PDF]
After attempting to use a home-grown Drupal database to administer electronic resources and later a vendor-provided electronic resources management (ERM) system, the University of Alaska Fairbanks Libraries created a Google Site that quickly proved to be
Jensen, Karen
core +1 more source
Misconceptions About the Long Division Algorithm in School Mathematics
The non-learning of school mathematics is now almost universally taken for granted, but this does not have to happen. This article takes a critical look at the root of this non-learning by pointing to the flagrant defects in the kind of mathematics—to be
Hung-Hsi Wu
doaj +1 more source
A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
We introduce a language, PSL, designed to capture high level proof strategies in Isabelle/HOL. Given a strategy and a proof obligation, PSL's runtime system generates and combines various tactics to explore a large search space with low memory usage ...
A Bundy +10 more
core +1 more source
The Judiciary, especially Labor, has been working to find a solution for the continuity of judicial activities remotely and telepresentially. The purpose of this article is to debate the importance of testimonial evidence in the telepresential work ...
Mauro Augusto Ponce de Leão Braga +1 more
doaj +1 more source
TLA+ is a specification language based on standard set theory and temporal logic that has constructs for hierarchical proofs. We describe how to write TLA+ proofs and check them with TLAPS, the TLA+ Proof System. We use Peterson's mutual exclusion algorithm as a simple example to describe the features of TLAPS and show how it and the Toolbox (an IDE ...
Cousineau, Denis +5 more
openaire +4 more sources
Efficient Certified Resolution Proof Checking [PDF]
We present a novel propositional proof tracing format that eliminates complex processing, thus enabling efficient (formal) proof checking. The benefits of this format are demonstrated by implementing a proof checker in C, which outperforms a state-of-the-
A Biere +29 more
core +3 more sources
Temperature tests of cells - uncertainty considerations [PDF]
The paper presents the estimation of the uncertainty in the measurement of the maximum surface temperature of voltaic cells exposed to specific tests for the type of intrinsic safety protection.
Darie Marius +4 more
doaj +1 more source
Disjoint NP-pairs from propositional proof systems [PDF]
For a proof system P we introduce the complexity class DNPP(P) of all disjoint NP-pairs for which the disjointness of the pair is efficiently provable in the proof system P.
C. Glaßer +15 more
core +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Razborov, Alexander A, Rudich, Steven
openaire +2 more sources

