Sciweavers

1485 search results - page 26 / 297
» Whole Program Paths
Sort
View
VTC
2010
IEEE
156views Communications» more  VTC 2010»
13 years 5 months ago
VERGILIUS: A Scenario Generator for VANET
—Vehicular networks are on the fast track to become a reality either through a car manufacturer that introduces a communication device in the car electronics or through an afterm...
Eugenio Giordano, Enzo De Sena, Giovanni Pau, Mari...
COMPSAC
2008
IEEE
14 years 2 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit
MOR
2000
162views more  MOR 2000»
13 years 7 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
PEPM
1995
ACM
13 years 11 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
IJCV
2002
156views more  IJCV 2002»
13 years 7 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal