Sciweavers

1795 search results - page 74 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
EH
2004
IEEE
125views Hardware» more  EH 2004»
14 years 15 days ago
Routine High-Return Human-Competitive Evolvable Hardware
This paper reviews the use of genetic programming as an automated invention machine for the synthesis of both the topology and sizing of analog electrical circuits. The paper focu...
John R. Koza, Martin A. Keane, Matthew J. Streeter
ATAL
2006
Springer
14 years 15 days ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
FORMATS
2008
Springer
13 years 10 months ago
Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
Alexander Rabinovich
CASES
2006
ACM
14 years 2 months ago
Methods for power optimization in distributed embedded systems with real-time requirements
Dynamic voltage scaling and sleep state control have been shown to be extremely effective in reducing energy consumption in CMOS circuits. Though plenty of research papers have st...
Razvan Racu, Arne Hamann, Rolf Ernst, Bren Mochock...
ARC
2008
Springer
95views Hardware» more  ARC 2008»
13 years 10 months ago
The Instruction-Set Extension Problem: A Survey
Over the last years, we have witnessed the increased use of Application-Specific Instruction-Set Processors (ASIPs). These ASIPs are processors that have a customizable instruction...
Carlo Galuzzi, Koen Bertels