Results 1  10
of
40,656
A nonincreasing Lindleytype equation
, 2005
"... Abstract: In this paper we study the Lindleytype equation W = max{0, B − A − W}. Its main characteristic is that it is a nonincreasing monotone function in its main argument W. Our main goal is to derive a closedform expression of the steadystate distribution of W. In general this is not possibl ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Abstract: In this paper we study the Lindleytype equation W = max{0, B − A − W}. Its main characteristic is that it is a nonincreasing monotone function in its main argument W. Our main goal is to derive a closedform expression of the steadystate distribution of W. In general
Selfsimilar scaling limits of nonincreasing Markov chains
, 2009
"... We study scaling limits of nonincreasing Markov chains with values in the set of nonnegative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We show that the chain starting from n and appropriately resca ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We study scaling limits of nonincreasing Markov chains with values in the set of nonnegative integers, under the assumption that the large jump events are rare and happen at rates that behave like a negative power of the current state. We show that the chain starting from n and appropriately
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
 IEEE Transactions on Parallel and Distributed Systems
"... We present a low complexity heuristic named the Dominant Sequence Clustering algorithm (DSC) for scheduling parallel tasks on an unbounded number of completely connected processors. The performance of DSC is comparable or even better on average than many other higher complexity algorithms. We assume ..."
Abstract

Cited by 207 (11 self)
 Add to MetaCart
We present a low complexity heuristic named the Dominant Sequence Clustering algorithm (DSC) for scheduling parallel tasks on an unbounded number of completely connected processors. The performance of DSC is comparable or even better on average than many other higher complexity algorithms. We
MULTIFACILITY LOCATION PROBLEM WITH NONINCREASING PIECEWISE LINEAR DEMAND ON A TREE
, 1999
"... Abstmct This paper deals with a multifacility location problem on a tree. Given the number of facilities and the tree structure, the problem is to find the optimal locations of facilities so as to maximize the service provider's gain obtained from customers accessing the nearest facility. Cust ..."
Abstract
 Add to MetaCart
Abstmct This paper deals with a multifacility location problem on a tree. Given the number of facilities and the tree structure, the problem is to find the optimal locations of facilities so as to maximize the service provider's gain obtained from customers accessing the nearest facility
SQUAREFREE MONOMIAL IDEALS THAT FAIL THE PERSISTENCE PROPERTY AND NONINCREASING DEPTH
"... Abstract. In a recent work [16], Kaiser, Stehĺık and Škrekovski provide a family of critically 3chromatic graphs whose expansions do not result in critically 4chromatic graphs, and thus give counterexamples to a conjecture of Francisco, Ha ̀ and Van Tuyl [7]. The cover ideal of the smallest memb ..."
Abstract
 Add to MetaCart
member of this family also gives a counterexample to the persistence and nonincreasing depth properties. In this paper, we show that the cover ideals of all members of their family of graphs indeed fail to have the persistence and nonincreasing depth properties. Dedicate to Professor Ngo ̂ Viêt Trung
NonIncrease Of Brownian Motion Via Branching Process Argument
"... . A new proof of the nonincrease of Brownian paths is given. 1. Introduction. We will give a new proof of the classical result on nonincrease of Brownian paths and present a short review of other known proofs. Suppose that fB(t); t 0g is a Brownian motion, B(0) = 0. We say that B has a point of i ..."
Abstract
 Add to MetaCart
. A new proof of the nonincrease of Brownian paths is given. 1. Introduction. We will give a new proof of the classical result on nonincrease of Brownian paths and present a short review of other known proofs. Suppose that fB(t); t 0g is a Brownian motion, B(0) = 0. We say that B has a point
Quantum thermodynamics with missing reference frames: Decompositions of free energy into nonincreasing components
"... energy into nonincreasing components ..."
2006), NoFlipping as a consequence of NoSignalling and Nonincrease of Entanglement under LOCC, Phys
 Lett. A
"... Non existence of Universal NOT gate for arbitrary quantum mechanical states is a fundamental constraint on the allowed operations performed on physical systems. The largest set of states that can be flipped by using a single NOT gate is the set of states lying on a great circle of the Blochsphere. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
sphere. In this paper, we show the impossibility of universal exactflipping operation, first by using the fact that no faster than light communication is possible and then by using the principle of “nonincrease of entanglement under LOCC”. Interestingly, in both the cases, there is no violation of the two principles
ADDITIVE RANK–ONE NONINCREASING MAPS ON HERMITIAN MATRICES OVER THE FIELD GF (2 2) ∗
"... Abstract. A complete classification of additive rank–one nonincreasing maps on hermitian matrices over Galois field GF (2 2) is obtained. This field is special and was not covered in a previous paper. As a consequence, some known applications, like the classification of additive rank–additivity pres ..."
Abstract
 Add to MetaCart
Abstract. A complete classification of additive rank–one nonincreasing maps on hermitian matrices over Galois field GF (2 2) is obtained. This field is special and was not covered in a previous paper. As a consequence, some known applications, like the classification of additive rank
Results 1  10
of
40,656