Sciweavers

608 search results - page 17 / 122
» Random Systems with Complete Connections
Sort
View
AAAI
2008
13 years 12 months ago
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
Yong Gao
CDC
2010
IEEE
186views Control Systems» more  CDC 2010»
13 years 4 months ago
Approximation and limiting behavior of random models
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
Behrouz Touri, Angelia Nedic
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
14 years 4 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras
SIGMETRICS
2010
ACM
214views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Distributed sensor network localization from local connectivity: performance analysis for the HOP-TERRAIN algorithm
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
Amin Karbasi, Sewoong Oh
ITC
1996
IEEE
98views Hardware» more  ITC 1996»
14 years 1 months ago
Mixed-Mode BIST Using Embedded Processors
Abstract. In complex systems, embedded processors may be used to run software routines for test pattern generation and response evaluation. For system components which are not comp...
Sybille Hellebrand, Hans-Joachim Wunderlich, Andre...