Sciweavers

1485 search results - page 68 / 297
» connection 2010
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 11 months ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win
ISOLA
2010
Springer
13 years 9 months ago
A Theory of Mediators for Eternal Connectors
On the fly synthesis of mediators is a revolutionary approach to the seamless networking of today’s and future digital systems that increasingly need be connected. The resulting...
Paola Inverardi, Valérie Issarny, Romina Sp...
JCT
2010
135views more  JCT 2010»
13 years 9 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
JSAC
2010
91views more  JSAC 2010»
13 years 9 months ago
Constructing low-connectivity and full-coverage three dimensional sensor networks
Abstract—Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k...
Chuanlin Zhang, Xiaole Bai, Jin Teng, Dong Xuan, W...
JUCS
2010
148views more  JUCS 2010»
13 years 9 months ago
Applying RFD to Construct Optimal Quality-Investment Trees
: River Formation Dynamics (RFD) is an evolutionary computation method based on copying how drops form rivers by eroding the ground and depositing sediments. Given a cost-evaluated...
Pablo Rabanal, Ismael Rodríguez, Fernando R...