Sciweavers

346 search results - page 45 / 70
» Logical omniscience as a computational complexity problem
Sort
View
IPPS
2003
IEEE
14 years 27 days ago
MUSE: A Software Oscilloscope for Clusters and Grids
Oscilloscopes and their cousins, logic analyzers, are the tools of choice for difficult electronic hardware problems. In the hands of a skilled engineer or technician, these tool...
Mark K. Gardner, Michael Broxton, Adam Engelhart, ...
MFCS
2009
Springer
14 years 2 months ago
Synthesis for Structure Rewriting Systems
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Lukasz Kaiser
HPCA
2004
IEEE
14 years 8 months ago
Exploring Wakeup-Free Instruction Scheduling
Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free...
Jie S. Hu, Narayanan Vijaykrishnan, Mary Jane Irwi...
HIPC
2004
Springer
14 years 1 months ago
A Parallel State Assignment Algorithm for Finite State Machines
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
David A. Bader, Kamesh Madduri
LOGCOM
2006
90views more  LOGCOM 2006»
13 years 7 months ago
ATL Satisfiability is Indeed EXPTIME-complete
The Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is being increasingly widely applied in the specification and verification of open distributed systems ...
Dirk Walther, Carsten Lutz, Frank Wolter, Michael ...