Sciweavers

10718 search results - page 304 / 2144
» On the Circuit Implementation Problem
Sort
View
LICS
1994
IEEE
15 years 10 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
CSREAESA
2003
15 years 8 months ago
Common Mistakes in Adiabatic Logic Design and How to Avoid Them
Most so-called “adiabatic” digital logic circuit families reported in the low-power design literature are actually not truly adiabatic, in that they do not satisfy the general...
Michael P. Frank
ICSE
2003
IEEE-ACM
16 years 6 months ago
Using Problem Frames with Distributed Architectures: A Case for Cardinality on Interfaces
Certain classes of problems amenable to description using Problem Frames, in particular ones intended to be implemented using a distributed architecture, can benefit by the additi...
Charles B. Haley
IPPS
2007
IEEE
16 years 29 days ago
Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem
— This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings...
Radoslav Andreev, Patrick Healy, Nikola S. Nikolov
ADMA
2005
Springer
189views Data Mining» more  ADMA 2005»
16 years 6 days ago
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String problem. Our implementation and experiments sho...
Xuan Liu, Hongmei He, Ondrej Sýkora