Using Combinatorial Optimization Methods for Quantification Scheduling
- 24 August 2001
- book chapter
- Published by Springer Nature
- p. 293-309
- https://doi.org/10.1007/3-540-44798-9_24
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- To split or to conjoinPublished by Association for Computing Machinery (ACM) ,2000
- Border-Block Triangular Form and Conjunction Schedule in Image ComputationPublished by Springer Nature ,2000
- NuSMV: A New Symbolic Model VerifierLecture Notes in Computer Science, 1999
- Efficient model checking by automated ordering of transition relation partitionsPublished by Springer Nature ,1994
- Convergence theorems for a class of simulated annealing algorithms on ℝdJournal of Applied Probability, 1992
- Finding good approximate vertex and edge partitions is NP-hardInformation Processing Letters, 1992
- Representing circuits more efficiently in symbolic model checkingPublished by Association for Computing Machinery (ACM) ,1991
- A tutorial survey of theory and applications of simulated annealingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Optimization by Simulated AnnealingScience, 1983
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970