Results 1  10
of
4,328
High Speed Switch Scheduling for Local Area Networks
 ACM Transactions on Computer Systems
, 1993
"... Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a prototype switch for an arbitrary topology pointtopoint network with link speeds of up to one gigabit per second. The s ..."
Abstract

Cited by 246 (3 self)
 Add to MetaCart
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a prototype switch for an arbitrary topology pointtopoint network with link speeds of up to one gigabit per second
A generalized processor sharing approach to flow control in integrated services networks: The singlenode case
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... The problem of allocating network resources to the users of an integrated services network is investigated in the context of ratebased flow control. The network is assumed to be a virtual circuit, connectionbased packet network. We show that the use of Generalized processor Sharing (GPS), when co ..."
Abstract

Cited by 2010 (5 self)
 Add to MetaCart
, the performance of a singleserver GPS system is analyzed exactly from the standpoint of worstcase packet delay and burstiness when the sources are constrained by leaky buckets. The worstcase session backlogs are also determined. In the sequel to this paper, these results are extended to arbitrary topology
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 534 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
Highly Dynamic DestinationSequenced DistanceVector Routing (DSDV) for Mobile Computers
, 1994
"... An adhoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such adhoc networks. The basic idea of the design is to operate each Mobile Host as a ..."
Abstract

Cited by 2076 (8 self)
 Add to MetaCart
An adhoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such adhoc networks. The basic idea of the design is to operate each Mobile Host
Randomized Gossip Algorithms
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 2006
"... Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join a ..."
Abstract

Cited by 532 (5 self)
 Add to MetaCart
Motivated by applications to sensor, peertopeer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such networks changes continuously as new nodes join
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. Introduction The task of calculating posterior marginals on nodes in an arbitrary Bayesian network is known to be NP hard In this paper we investigate the approximation performance of "loopy belief propagation". This refers to using the wellknown Pearl polytree algorithm [12] on a Bayesian network
Intrusion Detection in Wireless AdHoc Networks
, 2000
"... As the recent denialofservice attacks on several major Internet sites have shown us, no open computer network is immune from intrusions. The wireless adhoc network is particularly vulnerable due to its features of open medium, dynamic changing topology, cooperative algorithms, lack of centralized ..."
Abstract

Cited by 415 (4 self)
 Add to MetaCart
As the recent denialofservice attacks on several major Internet sites have shown us, no open computer network is immune from intrusions. The wireless adhoc network is particularly vulnerable due to its features of open medium, dynamic changing topology, cooperative algorithms, lack
Partially Reconfigurable PointtoPoint Interconnects in VirtexII Pro FPGAs
"... Abstract. Conventional rigid routerbased networks on chip incur certain overheads due to huge occupied logic resources and topology embedding, i.e., the mapping of a logical network topology to a physical one. In this paper, we present an implementation of partially reconfigurable pointtopoint (ρ ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Conventional rigid routerbased networks on chip incur certain overheads due to huge occupied logic resources and topology embedding, i.e., the mapping of a logical network topology to a physical one. In this paper, we present an implementation of partially reconfigurable pointtopoint
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
Scalefree characteristics of random networks: The topology of the worldwide web
 PHYSICA A
, 2000
"... The worldwide web forms a large directed graph, whose vertices are documents and edges are links pointing from one document to another. Here we demonstrate that despite its apparent random character, the topology of this graph has a number of universal scalefree characteristics. We introduce a mod ..."
Abstract

Cited by 350 (0 self)
 Add to MetaCart
The worldwide web forms a large directed graph, whose vertices are documents and edges are links pointing from one document to another. Here we demonstrate that despite its apparent random character, the topology of this graph has a number of universal scalefree characteristics. We introduce a
Results 1  10
of
4,328