Results 1  10
of
1,836,338
Rate of Convergence of the Fluid Approximation for Generalized Jackson Networks
 J. Appl. Prob
, 1996
"... It is known that a generalized open Jackson queueing network after appropriate scaling (in both time and space) converges almost surely to a fluid network under the uniform topology. Under the same topology, we show that the distance between the scaled queue length process of the queueing network an ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
It is known that a generalized open Jackson queueing network after appropriate scaling (in both time and space) converges almost surely to a fluid network under the uniform topology. Under the same topology, we show that the distance between the scaled queue length process of the queueing network
Stability of Generalized Jackson Networks with Permanent Customers
"... Jackson networks are typically open or closed: Either all customers join the network and eventually leave it, or no customers ever enter or exit. Here we focus on mixed Jackson networks, with both types of customers, general arrival streams and general service time distributions. We examine the stab ..."
Abstract
 Add to MetaCart
Jackson networks are typically open or closed: Either all customers join the network and eventually leave it, or no customers ever enter or exit. Here we focus on mixed Jackson networks, with both types of customers, general arrival streams and general service time distributions. We examine
Stationary Distribution Convergence for Generalized Jackson Networks in Heavy Traffic
 Mathematics of Operations Research
"... In a recent paper [5] it was shown that under suitable conditions stationary distributions of the (scaled) queue lengths process for a generalized Jackson network converge to the stationary distribution of the associated reflected Brownian motion in the heavy traffic limit. The proof relied on certa ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
In a recent paper [5] it was shown that under suitable conditions stationary distributions of the (scaled) queue lengths process for a generalized Jackson network converge to the stationary distribution of the associated reflected Brownian motion in the heavy traffic limit. The proof relied
Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks
"... In heavy traffic analysis of open queueing networks, processes of interest such as queue lengths and workload levels are generally approximated by a multidimensional reflected Brownian motion (RBM). Decomposition approximations, on the other hand, typically analyze stations in the network separately ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
separately, treating each as a single queue with adjusted interarrival time distribution. We present a hybrid method for analyzing generalized Jackson networks that employs both decomposition approximation and heavy traffic theory: stations in the network are partitioned into groups of "
Improving generalization with active learning
 Machine Learning
, 1994
"... Abstract. Active learning differs from "learning from examples " in that the learning algorithm assumes at least some control over what part of the input domain it receives information about. In some situations, active learning is provably more powerful than learning from examples ..."
Abstract

Cited by 535 (1 self)
 Add to MetaCart
alone, giving better generalization for a fixed number of training examples. In this article, we consider the problem of learning a binary concept in the absence of noise. We describe a formalism for active concept learning called selective sampling and show how it may be approximately implemented by a
An algorithm for drawing general undirected graphs
 Information Processing Letters
, 1989
"... Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets, and entit ..."
Abstract

Cited by 686 (2 self)
 Add to MetaCart
Graphs (networks) are very common data structures which are handled in computers. Diagrams are widely used to represent the graph structures visually in many information systems. In order to automatically draw the diagrams which are, for example, state graphs, dataflow graphs, Petri nets
Network information flow
 IEEE TRANS. INFORM. THEORY
, 2000
"... We introduce a new class of problems called network information flow which is inspired by computer network applications. Consider a pointtopoint communication network on which a number of information sources are to be mulitcast to certain sets of destinations. We assume that the information source ..."
Abstract

Cited by 1928 (24 self)
 Add to MetaCart
coding rate region. Our result can be regarded as the Maxflow Mincut Theorem for network information flow. Contrary to one’s intuition, our work reveals that it is in general not optimal to regard the information to be multicast as a “fluid” which can simply be routed or replicated. Rather
SupportVector Networks
 Machine Learning
, 1995
"... The supportvector network is a new learning machine for twogroup classification problems. The machine conceptually implements the following idea: input vectors are nonlinearly mapped to a very highdimension feature space. In this feature space a linear decision surface is constructed. Special pr ..."
Abstract

Cited by 3611 (35 self)
 Add to MetaCart
properties of the decision surface ensures high generalization ability of the learning machine. The idea behind the supportvector network was previously implemented for the restricted case where the training data can be separated without errors. We here extend this result to nonseparable training data.
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 1994 (5 self)
 Add to MetaCart
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
Results 1  10
of
1,836,338