Sciweavers

239 search results - page 21 / 48
» Random walks in a supply network
Sort
View
WWW
2009
ACM
14 years 9 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...
TSP
2008
100views more  TSP 2008»
13 years 8 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
ICCAD
2004
IEEE
100views Hardware» more  ICCAD 2004»
14 years 5 months ago
A chip-level electrostatic discharge simulation strategy
This paper presents a chip-level charged device model (CDM) electrostatic discharge (ESD) simulation method. The chip-level simulation is formulated as a DC analysis problem. A ne...
Haifeng Qian, Joseph N. Kozhaya, Sani R. Nassif, S...
ICRA
2007
IEEE
138views Robotics» more  ICRA 2007»
14 years 2 months ago
Latency Analysis of Coalescence for Robot Groups
— Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communicat...
Sameera Poduri, Gaurav S. Sukhatme
CN
2007
122views more  CN 2007»
13 years 8 months ago
Impact of mobility on the performance of relaying in ad hoc networks - Extended version
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...