1736 search results - page 129 / 348 » The rank-width of Directed Graphs |
156
click to vote
CORR
2012
Springer
14 years 6 days ago
2012
Springer
We present a novel approach to constraintbased causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about ca...
134
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
108
click to vote
WWW
2007
ACM
16 years 5 months ago
2007
ACM
PageRank is the best known technique for link-based importance ranking. The computed importance scores, however, are not directly comparable across different snapshots of an evolv...
128
click to vote
HCW
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper describes a simulation tool for the analysis of complex jobs described in the form of task graphs. The simulation procedure relies on the PN-based topological represent...
180
click to vote
ECML
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...