2137 search results - page 229 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
181
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
152
click to vote
IJCNN
2006
IEEE
16 years 13 days ago
2006
IEEE
— Recursive Neural Networks (RNNs) and Graph Neural Networks (GNNs) are two connectionist models that can directly process graphs. RNNs and GNNs exploit a similar processing fram...
165
Voted
ESANN
2004
15 years 7 months ago
2004
Several reinforcement-learning techniques have already been applied to the Acrobot control problem, using linear function approximators to estimate the value function. In this pape...
179
click to vote
AAAI
2008
15 years 8 months ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
162
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...