2796 search results - page 260 / 560 » The coolest path problem |
158
click to vote
INFOCOM
2006
IEEE
16 years 20 days ago
2006
IEEE
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
196
click to vote
WINE
2005
Springer
16 years 3 days ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
186
click to vote
CIAC
2000
Springer
15 years 11 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
145
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
199
click to vote
ICRA
1993
IEEE
15 years 10 months ago
1993
IEEE
We present an approach for solving the path planning problem for a mobile robot operating in an unknown, three dimensional environment containing obstacles of arbitrary shape. The...