5169 search results - page 109 / 1034 » Locality approximation using time |
129
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
173
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
131
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
135
click to vote
CISS
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— This paper presents an analysis of target localization accuracy, attainable by the use of MIMO (MultipleInput Multiple-Output) radar systems, configured with multiple ...
125
click to vote
IJCAI
1997
15 years 6 months ago
1997
Localization is the problem of determining the position of a mobile robot from sensor data. Most existing localization approaches are passive, i.e., they do not exploit the opport...