1795 search results - page 259 / 359 » On the Complexity of Circuit Satisfiability |
166
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
163
click to vote
FPL
1999
Springer
15 years 10 months ago
1999
Springer
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
148
click to vote
FCCM
1998
IEEE
15 years 10 months ago
1998
IEEE
PAM-Blox are object-oriented circuit generators on top of the PCI Pamette design environment, PamDC. High- performance FPGA design for adaptive computing is simplified by using a ...
180
click to vote
ECML
1997
Springer
15 years 10 months ago
1997
Springer
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
149
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
This paper presents the design of a Videophone CoderDecoder Motion Estimator using two High-Level Synthesis tools. Indeed, the combination of a Control Flow Dominated part (comple...