✦ LIBER ✦

On Holt's Algorithm

✍ Scribed by Greg Butler; John J. Cannon

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 138 KB
Volume: 15
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1993.1016

No coin nor oath required. For personal study only.

✦ Synopsis

For a p-group generated by permutations, an algorithm is presented to compute generators of a subnormal series with the strong generating property required by Holt's algorithm.

📜 SIMILAR VOLUMES

On Nagata′s Pairwise Algorithm

✍ W.Y. Chen; M.G. Leu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 346 KB

On the Correctness of Goscinski′s Algori

On the Correctness of Goscinski′s Algorithm

✍ R. Baldoni; B. Ciciani; G. Cioffi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 320 KB

A new Bayesian formulation for Holt's ex

A new Bayesian formulation for Holt's exponential smoothing

✍ Robert R. Andrawis; Amir F. Atiya 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

## Abstract In this paper we propose a Bayesian forecasting approach for Holt's additive exponential smoothing method. Starting from the state space formulation, a formula for the forecast is derived and reduced to a two‐dimensional integration that can be computed numerically in a straightforward

Holt

✍ Hunt, Kate 📂 Fiction 📅 2020 🌐 English ⚖ 27 KB 👁 1 views

On the optimality of Feautrier's schedul

On the optimality of Feautrier's scheduling algorithm

✍ Frédéric Vivien 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB

Tight Bound on Johnson's Algorithm for M

Tight Bound on Johnson's Algorithm for Maximum Satisfiability

✍ Jianer Chen; Donald K. Friesen; Hao Zheng 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability problem. In contrast to the common belief for two decades that Johnson's Algorithm has performance ratio 1Â2, we show that the performance ratio is 2Â3 and that this bound is