Sciweavers

1291 search results - page 74 / 259
» Arithmetic program paths
Sort
View
ENTCS
2006
109views more  ENTCS 2006»
13 years 9 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
ICCS
2004
Springer
14 years 3 months ago
Routing and Wavelength Assignments in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
Hyunseung Choo, Vladimir V. Shakhov
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 2 months ago
Shortest path optimization under limited information
— 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...
Michael Rinehart, Munther A. Dahleh
EURODAC
1994
IEEE
148views VHDL» more  EURODAC 1994»
14 years 1 months ago
BiTeS: a BDD based test pattern generator for strong robust path delay faults
This paper presents an algorithm for generation of test patterns for strong robust path delay faults, i.e. tests that propagate the fault along a single path and additionally are ...
Rolf Drechsler
ESA
2000
Springer
112views Algorithms» more  ESA 2000»
14 years 1 months ago
Resource Constrained Shortest Paths
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
Kurt Mehlhorn, Mark Ziegelmann