Sciweavers

1508 search results - page 10 / 302
» Efficient Path Profiling
Sort
View
FAW
2008
Springer
127views Algorithms» more  FAW 2008»
13 years 11 months ago
Visiting a Polygon on the Optimal Way to a Query Point
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
Ramtin Khosravi, Mohammad Ghodsi
APWEB
2003
Springer
14 years 1 months ago
A Web User Profiling Approach
People display regularities in almost everything they do. This paper proposes characteristics of an idealized algorithm that would allow an automatic extraction of web user profil ...
Younes Hafri, Chabane Djeraba, Peter L. Stanchev, ...
DAC
2006
ACM
14 years 10 months ago
Efficient detection and exploitation of infeasible paths for software timing analysis
Accurate estimation of the worst-case execution time (WCET) of a program is important for real-time embedded software. Static WCET estimation involves program path analysis and ar...
Vivy Suhendra, Tulika Mitra, Abhik Roychoudhury, T...
CC
2006
Springer
125views System Software» more  CC 2006»
14 years 1 months ago
Path-Based Reuse Distance Analysis
Abstract. Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse dista...
Changpeng Fang, Steve Carr, Soner Önder, Zhen...