336 search results - page 17 / 68 » Approximating Transitivity in Directed Networks |
97
Voted
ICANN
2007
Springer
15 years 6 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
111
Voted
CCR
2008
14 years 12 months ago
2008
y be more complex than the course modeling abstraction we adopted in [2]. Real AS relationships may depend on a peering point, prefix, and even time [2]. For example, ISPs that dom...
98
Voted
IWANN
1999
Springer
15 years 4 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
110
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
96
Voted
NIPS
1998
15 years 1 months ago
1998
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...