2252 search results - page 170 / 451 » Lower Bounds for Dynamic Algorithms |
129
Voted
IPPS
1999
IEEE
15 years 7 months ago
1999
IEEE
The management of networks has often been ignored in network-based computing systems due to the difficulty of estimating application programs' network latency and bandwidth r...
132
Voted
NN
1997
Springer
15 years 7 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
243
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
124
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we study a variation of the Dynamic Traveling Repairperson Problem (DTRP) in which there are two classes of demands; high priority, and low priority. In the probl...
121
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— We introduce a problem in which a service vehicle seeks to defend a deadline (boundary) from dynamically arriving mobile targets. The environment is a rectangle and the...