Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Handling Large Search Space in Pattern-Based Reverse Enginee...
Sort
relevance
views
votes
recent
update
View
thumb
title
146
Voted
JCM
2007
131
views
more
JCM 2007
»
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
15 years 3 months ago
Download
www.aloul.net
—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
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »