Results 1  10
of
1,477
A Modified StepLength Algorithm In Nonlinear A Modified StepLength Algorithm In Nonlinear Programming Programming
"... : Abstract: In this paper we consider a modification of the Armijo steplength algorithm based on socalled "forcing functions". It is proved that this modified algorithm is welldefined. Proof is given of the convergence of the obtained sequence of points to a firstorder point of the probl ..."
Abstract
 Add to MetaCart
: Abstract: In this paper we consider a modification of the Armijo steplength algorithm based on socalled "forcing functions". It is proved that this modified algorithm is welldefined. Proof is given of the convergence of the obtained sequence of points to a firstorder point
Maximin Algorithm With a StepLength Estimation Technique
"... Abstractâ€”We propose a technique that enhances the performance of Torrieri and Bakhruâ€™s maximin algorithm in the presence of frequency offsets and modulated interferences, a common scenario in multipleaccess environments, where we observed that the Maximin algorithm suffers performance degradation ..."
Abstract
 Add to MetaCart
degradation in the aforesaid scenario. To combat modulated interferences and fading effects, we propose to update the step length during every smart antenna weight vector update. We found that our scheme improves the robustness of the maximin algorithm to a greater extent. Simulation results for a frequency
PerformanceEffective and LowComplexity Task Scheduling for Heterogeneous Computing
 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
, 2002
"... Efficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NPcomplete in general cases as well as in several restricted cases. Because of its key importance, this problem has been exte ..."
Abstract

Cited by 255 (0 self)
 Add to MetaCart
and the CriticalPathonaProcessor (CPOP) algorithm. The HEFT algorithm selects the task with the highest upward rank value at each step and assigns the selected task to the processor, which minimizes its earliest finish time with an insertionbased approach. On the other hand, the CPOP algorithm uses
Bayesian inference on phylogeny and its impact on evolutionary biology.
 Science
, 2001
"... 1 As a discipline, phylogenetics is becoming transformed by a flood of molecular data. These data allow broad questions to be asked about the history of life, but also present difficult statistical and computational problems. Bayesian inference of phylogeny brings a new perspective to a number of o ..."
Abstract

Cited by 235 (10 self)
 Add to MetaCart
distribution that is the posterior probability distribution of the parameters. For the phylogeny problem, the MCMC algorithm involves two steps: (i) A new tree is proposed by stochastically perturbing the current tree. (ii) This tree is then either accepted or rejected with a probability described
The PATH Solver: A NonMonotone Stabilization Scheme for Mixed Complementarity Problems
 OPTIMIZATION METHODS AND SOFTWARE
, 1995
"... The Path solver is an implementation of a stabilized Newton method for the solution of the Mixed Complementarity Problem. The stabilization scheme employs a pathgeneration procedure which is used to construct a piecewiselinear path from the current point to the Newton point; a step length acceptan ..."
Abstract

Cited by 213 (40 self)
 Add to MetaCart
The Path solver is an implementation of a stabilized Newton method for the solution of the Mixed Complementarity Problem. The stabilization scheme employs a pathgeneration procedure which is used to construct a piecewiselinear path from the current point to the Newton point; a step length
Layered Representation of Motion Video using Robust MaximumLikelihood Estimation of Mixture Models and MDL Encoding
, 1995
"... Representing and modeling the motion and spatial support of multiple objects and surfaces from motion video sequences is an important intermediate step towards dynamic image understanding. One such representation, called layered representation, has recently been proposed. Although a number of algori ..."
Abstract

Cited by 204 (4 self)
 Add to MetaCart
of algorithms have been developed for computing these representations, there has not been a consolidated effort into developing a precise mathematical formulation of the problem. This paper presents such a formulation based on maximum likelihood estimation of mixture models and the minimum description length
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
steps in Fourier imaging by using a very large number of receivers. Kwiat et al. (4) proposed a similar concept in 1991. In 1989 Kelton et al. In all contributions procedures for image reconstruction were derived. However, applications of the concepts noted have not been reported, reflecting
An Analysis of the BurrowsWheeler Transform
 Journal of the ACM
, 2001
"... this paper we analyze two algorithms which use this technique. The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity, outperforms the Gzip compressor. The second one uses an additional runlength encoding step to improve compression. We prove that th ..."
Abstract

Cited by 173 (13 self)
 Add to MetaCart
this paper we analyze two algorithms which use this technique. The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity, outperforms the Gzip compressor. The second one uses an additional runlength encoding step to improve compression. We prove
Modification of the Armijo line search to satisfy the convergence properties of HS method
, 2014
"... The HestenesStiefel (HS) conjugate gradient algorithm is a useful tool of unconstrained numerical optimization, which has good numerical performance but no global convergence result under traditional line searches. This paper proposes a line search technique that guarantee the global convergence of ..."
Abstract
 Add to MetaCart
The HestenesStiefel (HS) conjugate gradient algorithm is a useful tool of unconstrained numerical optimization, which has good numerical performance but no global convergence result under traditional line searches. This paper proposes a line search technique that guarantee the global convergence
PROJECTED NEWTON METHODS FOR OPTIMIZATION PROBLEMS WITH SIMPLE CONSTRAINTS
, 1982
"... We consider the problem min {f(x)\x 201, and propose algorithms of the form xk+, = [xtakDkvf(xk)]+, where [.I+ denotes projection on the positive orthant, ak is a stepsize chosen by an Armijolike rule and Dk is a positive definite symmetric matrix which is partly diagonal. We show that Dk can be ..."
Abstract

Cited by 143 (4 self)
 Add to MetaCart
We consider the problem min {f(x)\x 201, and propose algorithms of the form xk+, = [xtakDkvf(xk)]+, where [.I+ denotes projection on the positive orthant, ak is a stepsize chosen by an Armijolike rule and Dk is a positive definite symmetric matrix which is partly diagonal. We show that Dk can
Results 1  10
of
1,477