635 search results - page 17 / 127 » Path Optimization in Programs and Its Application to Debuggi... |
ALT
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
104
click to vote
CGIM
2003
14 years 11 months ago
2003
A novel snake model suitable for edge extraction of bandshape objects is presented in this paper. Based on the proposed model, an edge tracking system, EdgeTrak, has been develope...
ISSTA
2009
ACM
15 years 4 months ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...