Sciweavers

4114 search results - page 29 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ESA
2000
Springer
104views Algorithms» more  ESA 2000»
15 years 7 months ago
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Ma...
IPL
2008
95views more  IPL 2008»
15 years 4 months ago
Efficient algorithms for finding interleaving relationship between sequences
The longest common subsequence and sequence alignment problems have been studied extensively and they can be regarded as the relationship measurement between sequences. However, m...
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Hs...
ICRA
2002
IEEE
121views Robotics» more  ICRA 2002»
15 years 9 months ago
An Efficient Approach to the Simultaneous Localisation and Mapping Problem
—The simultaneous localization and map building (SLAM) problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then...
Stefan B. Williams, Gamini Dissanayake, Hugh F. Du...
SECON
2010
IEEE
15 years 2 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...
ACSC
2010
IEEE
14 years 11 months ago
A batch algorithm for maintaining a topological order
The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change v...
David J. Pearce, Paul H. J. Kelly