127 search results - page 22 / 26 » Some Parameterized Problems On Digraphs |
152
Voted
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
133
Voted
NIPS
2003
15 years 4 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
152
Voted
FSTTCS
2010
Springer
15 years 19 days ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
117
Voted
SIGMETRICS
1998
ACM
15 years 6 months ago
1998
ACM
We consider the problem of scheduling tasks with unpredictable service times on distinct processing nodes so as to meet a real-time deadline, given that all communication among no...
112
Voted
ICALP
2003
Springer
15 years 7 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...