2800 search results - page 179 / 560 » Scaling RDF with time |
154
click to vote
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
We establish heavy-traffic limits for nearly deterministic queues, such as the G/D/n many-server queue. Since waiting times before starting service in the G/D/n queue are equivale...
179
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
200
click to vote
PVLDB
2010
15 years 5 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
198
click to vote
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
180
click to vote
ISLPED
2005
ACM
16 years 5 days ago
2005
ACM
Concerns about the reliability of real-time embedded systems that employ dynamic voltage scaling has recently been highlighted [1,2,3], focusing on transient-fault-tolerance techn...