Sciweavers

1399 search results - page 108 / 280
» Multi-party Finite Computations
Sort
View
CADE
1990
Springer
14 years 2 months ago
A Theorem Prover for a Computational Logic
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...
Robert S. Boyer, J. Strother Moore
AAAI
2010
13 years 11 months ago
An Approximate Subgame-Perfect Equilibrium Computation Technique for Repeated Games
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...
Andriy Burkov, Brahim Chaib-draa
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Computing Sparse Multiples of Polynomials
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[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
TEC
2008
127views more  TEC 2008»
13 years 10 months ago
Fingerprinting: Visualization and Automatic Analysis of Prisoner's Dilemma Strategies
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...
Daniel A. Ashlock, Eun-Youn Kim
DAC
2008
ACM
14 years 11 months ago
Automatic package and board decoupling capacitor placement using genetic algorithms and M-FDM
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...
Krishna Bharath, Ege Engin, Madhavan Swaminathan