Sciweavers

3678 search results - page 183 / 736
» On the Stable Paths Problem
Sort
View
162
Voted
SP
2007
IEEE
135views Security Privacy» more  SP 2007»
15 years 10 months ago
Exploring Multiple Execution Paths for Malware Analysis
Malicious code (or malware) is defined as software that fulfills the deliberately harmful intent of an attacker. Malware analysis is the process of determining the behavior and ...
Andreas Moser, Christopher Krügel, Engin Kird...
149
Voted
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 9 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
109
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
SRLG Failure Localization in All-Optical Networks Using Monitoring Cycles and Paths
—We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An S...
Satyajeet Ahuja, Srinivasan Ramasubramanian, Marwa...
136
Voted
AROBOTS
2006
108views more  AROBOTS 2006»
15 years 3 months ago
Relative localization using path odometry information
All mobile bases suffer from localization errors. Previous approaches to accommodate for localization errors either use external sensors such as lasers or sonars, or use internal s...
Nakju Lett Doh, Howie Choset, Wan Kyun Chung
147
Voted
JCM
2007
131views more  JCM 2007»
15 years 3 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