Refine Results
Sort By
From
To
Page 1
Page 1
Logic Synthesis for Compositional Microprogram Control Units
In this book control algorithms are represented by the linear graph-schemes of algorithms (GSA), where the number of operator vertices is not less than 75% of the total number of all algorithm vertices. A special class of control units named as compositional microprogram control units (CMCU) is proposed as the best way for interpretation of linear control algorithms.
Laplacian Eigenvectors of Graphs : Perron-Frobenius and Faber-Krahn Type Theorems
Eigenvectors of graph Laplacians have not, to date, been the subject of expository articles and thus they may seem a surprising topic for a book. The authors propose two motivations for this new LNM volume: (1) There are fascinating subtle differences between the properties of solutions of Schrödinger equations on manifolds on the one hand, and their discrete analogs on graphs. (2) "Geometric" properties of (cost) functions defined on the vertex sets of graphs are of practical interest for heuristic optimization algorithms. The observation that the cost functions of quite a few of the well-studied combinatorial optimization problems are eigenvectors of associated graph Laplacians has prompted the investigation of such eigenvectors.
