7778 search results - page 147 / 1556 » Designing Controllers for Reachability |
141
Voted
ICALP
2011
Springer
14 years 7 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...
119
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
135
click to vote
IWMM
2009
Springer
15 years 10 months ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
127
Voted
OOPSLA
2004
Springer
15 years 9 months ago
2004
Springer
This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint exis that the abstract state of the object to whi...
154
click to vote
IJCSS
2000
15 years 3 months ago
2000
Combination of sliding-mode control and an AI block based on fuzzy logic is introduced. This hybrid control structure provides very good control performance and robustness of contr...