1726 search results - page 31 / 346 » A resistance-based approach to consensus algorithm performan... |
123
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
142
click to vote
IMR
2004
Springer
15 years 9 months ago
2004
Springer
Mesh generation for finite element analysis is far from a solved problem. Although several automatic meshing algorithms exist, other difficulties of setting up a problem for finit...
111
Voted
DATE
2005
IEEE
15 years 9 months ago
2005
IEEE
It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimi...
118
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
In this work, the tracking analysis of the Normalized Least Mean Fourth (NLMF) algorithm is investigated for a random walk channel under very weak assumptions. The novelty of this...
133
click to vote
ISPASS
2008
IEEE
15 years 10 months ago
2008
IEEE
— This work addresses the problem of building representative subsets of benchmarks from an original large set of benchmarks, using statistical analysis techniques. The subsets sh...