3341 search results - page 611 / 669 » On Bounded Queries and Approximation |
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
USENIX
1994
14 years 11 months ago
1994
y-filled data block results in a delayed write,Abstract while a modification that fills a block results in an immediate, although asynchronous, write. TheSome file systems can dela...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract-- The calculation of network reliability in a probabilistic context has long been an issue of practical and academic importance. Conventional approaches (determination of ...
QUESTA
2010
14 years 8 months ago
2010
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
SIAMDM
2010
14 years 8 months ago
2010
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...