Sciweavers

1512 search results - page 64 / 303
» connection 2006
Sort
View
JCT
2010
135views more  JCT 2010»
14 years 8 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»
14 years 8 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»
14 years 8 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...
ACG
2006
Springer
15 years 3 months ago
A New Family of k-in-a-Row Games
First, this paper introduces a new family of k-in-a-row games, Connect(m, n, k, p, q). In Connect(m, n, k, p, q), two players alternately place p stones on an m × n board in each ...
I-Chen Wu, Dei-Yen Huang
IPPS
2006
IEEE
15 years 3 months ago
Fault and intrusion tolerance of wireless sensor networks
The following three questions should be answered in developing new topology with more powerful ability to tolerate node-failure in wireless sensor network. First, what is node-fai...
Liang-min Wang, Jianfeng Ma, Chao Wang, A. C. Kot