Sciweavers

1485 search results - page 13 / 297
» Whole Program Paths
Sort
View
BIRTHDAY
2010
Springer
13 years 8 months ago
Counterexample Guided Path Reduction for Static Program Analysis
Abstract. In this work we introduce counterexample guided path reduction based on interval constraint solving for static program analysis. The aim of this technique is to reduce th...
Ansgar Fehnker, Ralf Huuck, Sean Seefried
NETWORKS
2008
13 years 7 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
SIGSOFT
2005
ACM
14 years 8 months ago
Arithmetic program paths
We present Arithmetic Program Paths, a novel, efficient way to compress program control-flow traces that reduces program bit traces to less than a fifth of their original size whi...
Manos Renieris, Shashank Ramaprasad, Steven P. Rei...
IEEEPACT
2006
IEEE
14 years 1 months ago
Program generation for the all-pairs shortest path problem
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
Sung-Chul Han, Franz Franchetti, Markus Püsch...
VTC
2006
IEEE
118views Communications» more  VTC 2006»
14 years 1 months ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
Fulu Li, Andrew Lippman, Kui Wu