1399 search results - page 33 / 280 » New Algorithms for k-Center and Extensions |
ACSC
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
WAOA
2010
Springer
13 years 7 months ago
2010
Springer
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
AAAI
2012
11 years 11 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
IJCAI
2007
13 years 10 months ago
2007
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attentio...
TC
2010
13 years 7 months ago
2010
— Although data prefetching algorithms have been extensively studied for years, there is no counterpart research done for metadata access performance. Existing data prefetching a...