Results 11  20
of
5,072
On the Synthesis of Strategies in Infinite Games
, 1995
"... . Infinite twoperson games are a natural framework for the study of reactive nonterminating programs. The effective construction of winning strategies in such games is an approach to the synthesis of reactive programs. We describe the automata theoretic setting of infinite games (given by "gam ..."
Abstract

Cited by 192 (7 self)
 Add to MetaCart
switching circuits. These circuits were considered as transforming infinite input sequences into output sequences, and systems of restricted arithmetic served as specification formalisms ([Ch63]). With Buchi's decision procedure for the monadic secondorder theory S1S of one successor ([Bu62
Multicast Scheduling for InputQueued Switches
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
"... This paper presents the design of the scheduler for an M × N inputqueued multicast switch. It is assumed that: (i) Each input maintains a single queue for arriving multicast cells, and (ii) Only the cell at the head of line (HOL) can be observed and scheduled at one time. The scheduler is ..."
Abstract

Cited by 60 (2 self)
 Add to MetaCart
This paper presents the design of the scheduler for an M × N inputqueued multicast switch. It is assumed that: (i) Each input maintains a single queue for arriving multicast cells, and (ii) Only the cell at the head of line (HOL) can be observed and scheduled at one time. The scheduler
Transition Density, A New Measure of Activity in Digital Circuits
 IEEE Transactions on ComputerAided Design
, 1992
"... Reliability assessment is an important part of the design process of digital integrated circuits. We observe that a common thread that runs through most causes of runtime failure is the extent of circuit activity, i.e., the rate at which its nodes are switching. We propose a new measure of activity ..."
Abstract

Cited by 180 (25 self)
 Add to MetaCart
of activity, called the transition density, which may be defined as the "average switching rate" at a circuit node. Based on a stochastic model of logic signals, we also present an algorithm to propagate density values from the primary inputs to internal and output nodes. To illustrate the practical
On the Stability of InputQueued Switches with SpeedUp
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 2001
"... We consider cellbased switch and router architectures whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred toward output ports. In t ..."
Abstract

Cited by 70 (6 self)
 Add to MetaCart
We consider cellbased switch and router architectures whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred toward output ports
Probability product kernels
 Journal of Machine Learning Research
, 2004
"... The advantages of discriminative learning algorithms and kernel machines are combined with generative modeling using a novel kernel between distributions. In the probability product kernel, data points in the input space are mapped to distributions over the sample space and a general inner product i ..."
Abstract

Cited by 180 (9 self)
 Add to MetaCart
The advantages of discriminative learning algorithms and kernel machines are combined with generative modeling using a novel kernel between distributions. In the probability product kernel, data points in the input space are mapped to distributions over the sample space and a general inner product
Performance and Stability of Communication Networks via Robust Exponential Bounds
 IEEE/ACM Transactions on Networking
, 1993
"... We propose a new way for evaluating the performance of packet switching communication networks under a fixed (session based) routing strategy. Our approach is based on properly bounding the probability distribution functions of the system input processes. The bounds we suggest, which are decaying ex ..."
Abstract

Cited by 150 (3 self)
 Add to MetaCart
We propose a new way for evaluating the performance of packet switching communication networks under a fixed (session based) routing strategy. Our approach is based on properly bounding the probability distribution functions of the system input processes. The bounds we suggest, which are decaying
Identifying the minimal transversals of a hypergraph and related problems
 SIAM Journal on Computing
, 1995
"... The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation, i.e., given a hypergraph H, decide if every subset of vertic ..."
Abstract

Cited by 155 (8 self)
 Add to MetaCart
in H 2 are all the minimal transversals of H 1. The complexity of the search problem related to the recognition of the transversal hypergraph, the computation of the transversal hypergraph, is an open problem. This task needs time exponential in the input size, but it is unknown whether an output
InputQueued ATM Switch
"... 1 Introduction Asynchronous Transfer Mode (ATM) has been standardized as the multiplexing and switching technique for Broadband Integrated Services Digital Network (BISDN). The ability to provide guaranteed bandwidth within an acceptable cell transfer delay bound is critical to multimedia applicati ..."
Abstract
 Add to MetaCart
for improving the performance of input and output buffered switch architectures for ATM applications. The internal bandwidth of a switch fabric can be expanded, enabling it to transmit k cells, by replicating the crossbar or more typically the Banyan part of the BatcherBanyan switch k times [1]. With enough
Scheduling InputQueued Switches
"... A new scheduling algorithm for inputqueued cell switches, referred to as shadow departure time algorithm (SDTA), is introduced. Simulations demonstrate that the SDTA's cell delay distribution is more desirable than those of the GSOCF and GSLQF algorithms in terms of cell overdue probability. ..."
Abstract
 Add to MetaCart
A new scheduling algorithm for inputqueued cell switches, referred to as shadow departure time algorithm (SDTA), is introduced. Simulations demonstrate that the SDTA's cell delay distribution is more desirable than those of the GSOCF and GSLQF algorithms in terms of cell overdue probability.
Results 11  20
of
5,072