1399 search results - page 108 / 280 » Multi-party Finite Computations |
133
click to vote
CADE
1990
Springer
15 years 8 months ago
1990
Springer
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
120
click to vote
AAAI
2010
15 years 5 months ago
2010
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect equilibria (SPE) in repeated games with discounting. The process starts with a s...
151
click to vote
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
146
click to vote
TEC
2008
15 years 3 months ago
2008
Fingerprinting is a technique for generating a representation-independent functional signature for a game playing agent. Fingerprints can be used to compare agents across represent...
139
Voted
DAC
2008
ACM
16 years 5 months ago
2008
ACM
In the design of complex power distribution networks (PDN) with multiple power islands, it is required that the PDN represents a low impedance as seen by the digital modules. This...