Readfeed

Tomoyasu Nakagawa

  • A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
  • A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)A branch-and-bound algorithm for optimal AND-OR networks (the algorithm description)
  • A branch-and-bound algorithm for optimal NOR networks (the algorithm description)A branch-and-bound algorithm for optimal NOR networks (the algorithm description)
  • A branch-and-bound algorithm for optimal NOR networks (the algorithm description)A branch-and-bound algorithm for optimal NOR networks (the algorithm description)
  • Comparison of the implicit enumeration method and the branch-and-bound method for logical designComparison of the implicit enumeration method and the branch-and-bound method for logical design
  • Comparison of the implicit enumeration method and the branch-and-bound method for logical designComparison of the implicit enumeration method and the branch-and-bound method for logical design
  • Design algorithm of optimal NOR networks by the branch-and-bound approachDesign algorithm of optimal NOR networks by the branch-and-bound approach
  • Pruning and branching methods for designing optimal networks by the branch-and-bound methodPruning and branching methods for designing optimal networks by the branch-and-bound method
  • Reference manual of FORTRAN program ILLOD-(AND-OR-B) for optimal AND-OR networksReference manual of FORTRAN program ILLOD-(AND-OR-B) for optimal AND-OR networks
  • Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networksReference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks
  • Reference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networksReference manual of FORTRAN program ILLOD-(NOR-B) for optimal NOR networks