Segmented channel routing with pin rearrangements via satisfiability.
Fei HeWilliam N. N. HungXiaoyu SongMing GuJiaguang SunPublished in: ISCAS (6) (2005)
Keyphrases
- satisfiability problem
- propositional logic
- routing algorithm
- np complete
- multi channel
- routing problem
- division multiple access
- switched networks
- communication channels
- routing protocol
- phase transition
- computational complexity
- ad hoc networks
- network topology
- decision procedures
- multiple access
- mobile ad hoc networks
- code division multiple access
- inter domain
- routing decisions
- terminological reasoning