（为.djvu文件，可用WinDjView 打开） COMPUTERS AND INTRACTABILITY： A Guide to the Theory of NP-Completeness by Michael R. Garey & David S. Johnson Content 1 Computers, Complexity, and Intractability 1 1.1 Introduction 1 1.2 Problems, Algorithms, and Complexity
Reviews from the First Edition: "An excellent text ... The postulates of quantum mechanics and the mathematical underpinnings are discussed in a clear, succinct manner." (American Scientist) "No matter how gently one introduces students to the conce
Hamiltonian dynamics can be used to produce distant proposals for the Metropolis algorithm, thereby avoiding the slow exploration of the state space that results from the diffusive behaviour of simple random-walk proposals. Though originating in phy
This paper investigates adaptive H control problem for switched dissipative Hamiltonian systems(SDHSs). Firstly, using the dissipative Hamiltonian structural properties, such systems generated an augmentedSDHS, with which some results on the control
In high speed backbone networks, the survivability is a very important issue since the networks carry a lot of traffic. In this paper, we study the protection method with Hamiltonian Cycle in meshed survivable backbone networks, and proposed a new he
