Results 1  10
of
2,883,582
Automatic Factorization of Generalized Upper Bounds
, 1979
"... Automatic factorization of generalized upper bounds in large scale optimization problems. ..."
Abstract
 Add to MetaCart
Automatic factorization of generalized upper bounds in large scale optimization problems.
Automatic Factorization of Generalized Upper Bounds in Large Scale Optimization Models
, 1980
"... Automatic factorization of generalized upper bounds in large scale optimization models ..."
Abstract
 Add to MetaCart
Automatic factorization of generalized upper bounds in large scale optimization models
The Supersymmetric Singlet Majoron Model and the General Upper Bound on the
"... An upper bound on the treelevel mass of the lightest Higgs boson of the Supersymmetric Singlet Majoron Model is obtained. Contrary to some recent claims, it is shown to be of the same form as the general mass bound previously calculated for supersymmetric models with an extended Higgs sector. Soft ..."
Abstract
 Add to MetaCart
An upper bound on the treelevel mass of the lightest Higgs boson of the Supersymmetric Singlet Majoron Model is obtained. Contrary to some recent claims, it is shown to be of the same form as the general mass bound previously calculated for supersymmetric models with an extended Higgs sector. Soft
Improved and Generalized Upper Bounds on the Complexity of Policy Iteration
, 2013
"... Given a Markov Decision Process (MDP) with n states and m actions per state, we study the number of iterations needed by Policy Iteration (PI) algorithms to converge to the optimal γdiscounted optimal policy. We consider two variations of PI: Howard’s PI that changes the actions in all states with ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(m − 1)⌈2(n − 1) log n⌉⌈2n log n ⌉ = O(n 4 m 2 log 2 n) iterations, improving by a factor O(n) a bound obtained by Post and Ye (2012). We generalize this result to stochastic MDPs: given a measure of the maximal transient time τt and the maximal time τr to revisit states in recurrent classes under all
An Improved General Upper Bound for AllTerminal Network Reliability
 PROCEEDINGS OF THE INDUSTRIAL ENGINEERING RESEARCH CONFERENCE
, 1998
"... The exact calculation of allterminal network reliability is an NPhard problem, precluding its use in the design of optimal network topologies for problems of realistic size. This paper presents an improved upper bound for allterminal network reliability that is significantly more general than p ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
The exact calculation of allterminal network reliability is an NPhard problem, precluding its use in the design of optimal network topologies for problems of realistic size. This paper presents an improved upper bound for allterminal network reliability that is significantly more general than
A general upper bound on the size of constantweight conflictavoiding codes
 IEEE Trans. Inform. Theory
"... Abstract—Conflictavoiding codes are used in the multipleaccess collision channel without feedback. The number of codewords in a conflictavoiding code is the number of potential users that can be supported in the system. In this paper, a new upper bound on the size of constantweight conflictavo ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and all Hamming weights. Several existing constructions for conflictavoiding codes, which are known to be optimal for Hamming weights equal to four and five, are shown to be optimal for all Hamming
A general upper bound on the list chromatic number of locally sparse graphs
 Combinatorics, Probability and Computing
"... Abstract. Suppose that G is a graph with maximum degree ∆ and for every vertex v in G, the neighborhood of v contains at most ∆2 /f edges. We prove that the list chromatic number of G is at most K∆ / log f, for some positive constant K. This result strengthens several previous results [AKSu2, Kim, J ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
, Joh, Vu1] and is sharp up to the multiplicative constant K. As an application, we shall derive several upper bounds for the strong (list) chromatic index of a graph, under various assumptions. These bounds improve earlier results in [FGST,Mah] and determine, up to a constant factor, the strong (list
Results 1  10
of
2,883,582