127 search results - page 22 / 26 » Some Parameterized Problems On Digraphs |
103
click to vote
ATAL
2005
Springer
15 years 3 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...
NIPS
2003
14 years 10 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...
106
click to vote
FSTTCS
2010
Springer
14 years 7 months 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...
SIGMETRICS
1998
ACM
15 years 1 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...
ICALP
2003
Springer
15 years 2 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 ...