1594 search results - page 140 / 319 » An Algorithm to Compute Collusion Paths |
126
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— Teaching a robot to learn new knowledge is a repetitive and tedious process. In order to accelerate the process, we propose a novel template-based approach for robot arm moveme...
141
click to vote
LCN
2003
IEEE
15 years 8 months ago
2003
IEEE
We consider wireless multicast tree construction for energy efficiency. We introduce a novel algorithm, Incremental Shortest Path Tree (ISPT), to generate source-based multicast ...
142
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
Abstract— This paper studies the problem of designing survivable optical wavelength division multiplexed (WDM) networks. A wavelength-routed wide area backbone network supporting...
131
click to vote
BROADNETS
2004
IEEE
15 years 7 months ago
2004
IEEE
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
111
click to vote
SIGCOMM
2006
ACM
15 years 9 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...