966 search results - page 134 / 194 » Small Alliances in Graphs |
FUN
2007
Springer
14 years 1 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
CASES
2004
ACM
14 years 1 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
FORMATS
2006
Springer
14 years 1 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
ISLPED
1995
ACM
14 years 1 months ago
1995
ACM
Abstract: We describe a technique to estimate the energy consumed by speed-independent asynchronous (clockless) control circuits. Because speed-independent circuits are hazard-free...
KDD
1995
ACM
14 years 1 months ago
1995
ACM
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...