667 search results - page 50 / 134 » Approximation algorithms for connected facility location pro... |
98
Voted
MOBIQUITOUS
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— In future generation networks, various access technologies, such as Wi-Fi, Bluetooth, GPRS and UMTS, etc., are simultaneously available to mobile devices. They vary in ...
150
click to vote
CPM
1998
Springer
15 years 4 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
128
Voted
SAC
2003
ACM
15 years 5 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
119
click to vote
DCOSS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
151
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...