6514 search results - page 133 / 1303 » Low-Knowledge Algorithm Control |
91
Voted
RP
2010
Springer
14 years 11 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
126
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...
COMCOM
2004
15 years 1 months ago
2004
We propose two flow control algorithms for networks with multiple paths between each source
120
click to vote
ISSTA
1998
ACM
15 years 6 months ago
1998
ACM
Automated analyses for regression test selection (RTS) attempt to determine if a modified program, when run on a test t, will have the same behavior as an old version of the prog...
91
Voted
DAC
2004
ACM
16 years 2 months ago
2004
ACM
ion Refinement by Controllability and Cooperativeness Analysis Freddy Y.C. Mang and Pei-Hsin Ho Advanced Technology Group, Synopsys, Inc. {fmang, pho}@synopsys.com nt a new abstrac...