Sciweavers

6 search results - page 2 / 2
» Handling Large Search Space in Pattern-Based Reverse Enginee...
Sort
View
JCM
2007
131views more  JCM 2007»
13 years 5 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze