3341 search results - page 408 / 669 » On Bounded Queries and Approximation |
163
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
184
click to vote
ECRTS
2006
IEEE
16 years 21 days ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
187
click to vote
ICDE
2006
IEEE
16 years 21 days ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
179
click to vote
STOC
2006
ACM
16 years 18 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
169
click to vote
CAIP
2005
Springer
16 years 6 days ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...