Sciweavers

1945 search results - page 302 / 389
» Pursuit-Evasion in Models of Complex Networks
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
AI
2008
Springer
13 years 6 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
IFIPTCS
2010
13 years 6 months ago
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...
Arnaud Casteigts, Paola Flocchini, Bernard Mans, N...
RTSS
2008
IEEE
14 years 2 months ago
Fast Sensor Placement Algorithms for Fusion-Based Target Detection
Mission-critical target detection imposes stringent performance requirements for wireless sensor networks, such as high detection probabilities and low false alarm rates. Data fus...
Zhaohui Yuan, Rui Tan, Guoliang Xing, Chenyang Lu,...
INFOSCALE
2006
ACM
14 years 2 months ago
PENS: an algorithm for density-based clustering in peer-to-peer systems
Huge amounts of data are available in large-scale networks of autonomous data sources dispersed over a wide area. Data mining is an essential technology for obtaining hidden and v...
Mei Li, Guanling Lee, Wang-Chien Lee, Anand Sivasu...