1632 search results - page 60 / 327 » Sublinear Time Algorithms for Metric Space Problems |
118
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
125
click to vote
TCS
2008
15 years 3 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
135
Voted
DAC
2012
ACM
13 years 5 months ago
2012
ACM
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
172
Voted
TSP
2008
15 years 3 months ago
2008
In the traditional transmitting beamforming radar system, the transmitting antennas send coherent waveforms which form a highly focused beam. In the multiple-input multipleoutput (...
145
click to vote
ECCC
2010
15 years 25 days ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...