✦ LIBER ✦

Efficient Searching with Linear Constraints

✍ Scribed by Pankaj K Agarwal; Lars Arge; Jeff Erickson; Paulo G Franciosa; Jeffrey Scott Vitter

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 457 KB
Volume: 61
Category: Article
ISSN: 0022-0000
DOI: 10.1006/jcss.2000.1709

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Searching with Local Constraints on Erro

Searching with Local Constraints on Error Patterns

✍ Jurek Czyzowicz; K.B. Lakshmanan; Andrzej Pelc 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 175 KB

We give an asymptotically optimal algorithm of search for an unknown element in a finite set under the assumption that at most one error can occur in every sequence of \(r\) consecutive answers, where \(r \geqslant 3\) is a constant.

Linear constraints, robust-weighting and

Linear constraints, robust-weighting and efficient composite modeling

✍ John B. Guerard Jr. 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 435 KB

Recent studies have shown that composite forecasting produces superior forecasts when compared to individual forecasts. This paper extends the existing literature by employing linear constraints and robust regression techniques in composite model building. Security analysts forecasts may be improved

Greedy linear extensions with constraint

Greedy linear extensions with constraints

✍ Ivan Rival; Nejib Zaguia 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 762 KB

Loosely speaking, a greedy linear extension of an ordered set is a linear extension obtained by following the rule: "climb as high as you can". Given an ordered set P and a partial extension P' of P is there a greedy linear extension of P which satisfies all of the inequalities of P'? We consider sp

Linear constraints and the efficiency of

Linear constraints and the efficiency of combined forecasts

✍ Robert T. Clemen 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 436 KB

Studies of combined forecasts have typically constrained the combining weights to sum to one and have not included a constant term in the combination. In a recent paper, Granger and Ramanathan (1984) have argued in favour of an unrestricted linear combination, including a constant term. This paper s

Linear constraints and the efficiency of

Linear constraints and the efficiency of combined forecasts

✍ G. Trenkler; E. P. Liski 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB

This note extends some recent results, achieved by Clemen, on constraining the weights of a combined forecast. There is a great potential for improving the ordinary least squares forecast by imposing linear restrictions, and it will be shown how this potential can be exhausted by using an F-test. Th

Combinatorial constraints on searching f

Combinatorial constraints on searching for optimal real or symmetric linear array excitation distributions

✍ A. Trastoy; J. A. Rodríguez; F. Ares 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

Gi¨en a null-filled radiation power pattern to be synthesized by a linear antenna array, optimally realizable excitation distributions satisfying the requirements of being symmetric or in phase can be found by means of a genetic algorithm approach.