Sciweavers

667 search results - page 90 / 134
» Approximation algorithms for connected facility location pro...
Sort
View
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
16 years 27 days ago
Multi-robot routing under limited communication range
Abstract— Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A...
Alejandro R. Mosteo, Luis Montano, Michail G. Lago...
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
16 years 15 days ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 5 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
16 years 19 days ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
SECON
2010
IEEE
15 years 4 months ago
Transmission Scheduling for Routing Paths in Cognitive Radio Mesh Networks
Nodes in a cognitive radio mesh network may select from a set of available channels to use provided they do not interfere with primary users. This ability can improve overall netwo...
Brendan Mumey, Xia Zhao, Jian Tang, Richard S. Wol...