Sciweavers

3359 search results - page 138 / 672
» A Simplified Idea Algorithm
Sort
View
TROB
2002
174views more  TROB 2002»
15 years 4 months ago
A general algorithm for robot formations using local sensing and minimal communication
Abstract-We study the problem of achieving global behavior in a group of distributed robots using only local sensing and minimal communication, in the context of formations. The go...
Jakob Fredslund, Maja J. Mataric
156
Voted
MOBIHOC
2007
ACM
16 years 4 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
MOBIHOC
2002
ACM
16 years 4 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
165
Voted
CN
2006
99views more  CN 2006»
15 years 4 months ago
High-performance switching based on buffered crossbar fabrics
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
Lotfi Mhamdi, Mounir Hamdi, Christopher Kachris, S...
TVCG
2008
103views more  TVCG 2008»
15 years 4 months ago
Perceptually Guided Polygon Reduction
The properties of the human visual system are taken into account, along with the geometric aspects of an object, in a new surface remeshing algorithm and a new mesh simplification ...
Lijun Qu, Gary W. Meyer