Results 1  10
of
1,050
Policy gradient methods for reinforcement learning with function approximation.
 In NIPS,
, 1999
"... Abstract Function approximation is essential to reinforcement learning, but the standard approach of approximating a value function and determining a policy from it has so far proven theoretically intractable. In this paper we explore an alternative approach in which the policy is explicitly repres ..."
Abstract

Cited by 439 (20 self)
 Add to MetaCart
that the gradient can be written in a form suitable for estimation from experience aided by an approximate actionvalue or advantage function. Using this result, we prove for the first time that a version of policy iteration with arbitrary differentiable function approximation is convergent to a locally optimal
Supporting Stored Video: Reducing Rate Variability and EndtoEnd Resource Requirements through Optimal Smoothing
 IEEE/ACM Transactions on Networking
, 1998
"... Variablebitrate compressed video can exhibit significant, multipletimescale bit rate variability. In this paper we consider the transmission of stored video from a server to a client across a network, and explore how the client buffer space can be used most effectively toward reducing the variab ..."
Abstract

Cited by 273 (18 self)
 Add to MetaCart
the variability of the transmitted bit rate. Two basic results are presented. First, we show how to achieve the greatest possible reduction in rate variability when sending stored video to a client with given buffer size. We formally establish the optimality of our approach and illustrate its performance over a
On the Hardness of Approximate Reasoning
, 1996
"... Many AI problems, when formalized, reduce to evaluating the probability that a propositional expression is true. In this paper we show that this problem is computationally intractable even in surprisingly restricted cases and even if we settle for an approximation to this probability. We consider va ..."
Abstract

Cited by 289 (13 self)
 Add to MetaCart
over a propositional domain. We prove that counting satisfying assignments of propositional languages is intractable even for Horn and monotone formulae, and even when the size of clauses and number of occurrences of the variables are extremely limited. This should be contrasted with the case
An Approximate MaxFlow MinCut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms
, 1989
"... In this paper, we consider a multicommodity flow problem where for each pair of vertices, (u,v), we are required to sendf halfunits of commodity (uv) from u to v and f halfunits of commodity (vu) from v to u without violating capacity constraints. Our main result is an algorithm for performing th9 ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
can prove that any nnode bounded degree graph, G, with minimum edge expansion h can be configured offline to simulate any nnode bounded degree graph H in 0(log n/a)steps using constant size queues. By letting H be a universal network, we can then use G to simulate a PRAM online with elay 0(log2 n1
An size faulttolerant sorting network
 In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing
, 1996
"... Abstract This thesis studies sorting circuits, networks, and PRAM algorithms that are tolerant to faults. We consider both worstcase and random fault models, although we mainly focus on the more challenging problem of random faults. In the random fault model, the circuit, network, or algorithm is r ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
, thereby answering an open question posed by Yao and Yao in 1985, ffl we construct a reversalfaulttolerant sorting network with O(n loglog2 3 n) comparators, thereby answering an open question posed by Assaf and Upfal in 1990, ffl we design an optimal O(log n)step O(n)processor deterministic EREW PRAM
Empirical comparison of algorithms for network community detection
 In Proc. WWW’10
, 2010
"... Detecting clusters or communities in large realworld graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses an objective function that captures the intuition of a network cluster as set of nodes with better internal connectivity ..."
Abstract

Cited by 171 (5 self)
 Add to MetaCart
methods in order to compare them and to understand their relative performance and the systematic biases in the clusters they identify. We evaluate several common objective functions that are used to formalize the notion of a network community, and we examine several different classes of approximation
Declarative Networking: Language, Execution and Optimization
, 2006
"... The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for a nextgeneration Internet architecture. In this context, we have investigated declarative networking: the use of a dis ..."
Abstract

Cited by 120 (29 self)
 Add to MetaCart
in this domain. First, we motivate and formally define the Network Datalog (NDlog) language for declarative network specifications. Second, we introduce and prove correct relaxed versions of the traditional semina ve query evaluation technique, to overcome fundamental problems of the traditional technique
Learning to rank with nonsmooth cost functions
 In Advances in Neural Information Processing Systems (NIPS) 20
, 2006
"... The quality measures used in information retrieval are particularly difficult to optimize directly, since they depend on the model scores only through the sorted order of the documents returned for a given query. Thus, the derivatives of the cost with respect to the model parameters are either zero ..."
Abstract

Cited by 176 (11 self)
 Add to MetaCart
The quality measures used in information retrieval are particularly difficult to optimize directly, since they depend on the model scores only through the sorted order of the documents returned for a given query. Thus, the derivatives of the cost with respect to the model parameters are either
Abstractions for network update
 In ACM SIGCOMM’12
, 2012
"... Configuration changes are a common source of instability in networks, leading to outages, performance disruptions, and security vulnerabilities. Even when the initial and final configurations are correct, the update process itself often steps through intermediate configurations that exhibit incorrec ..."
Abstract

Cited by 138 (20 self)
 Add to MetaCart
for implementing them in SoftwareDefined Networks using switch APIs like OpenFlow. We develop a formal model of OpenFlow networks, and prove that consistent updates preserve a large class of properties. We describe our prototype implementation, including several optimizations that reduce the overhead required
Nearoptimal sensor placements: Maximizing information while minimizing communication cost
 In IPSN
, 2006
"... When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this paper, we present a datadriven approach that addresses the three ..."
Abstract

Cited by 152 (19 self)
 Add to MetaCart
When monitoring spatial phenomena with wireless sensor networks, selecting the best sensor placements is a fundamental task. Not only should the sensors be informative, but they should also be able to communicate efficiently. In this paper, we present a datadriven approach that addresses the three
Results 1  10
of
1,050