𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Feasibility Result for the Block Interval Gaussian Algorithm

✍ Scribed by U. Schäfer

Publisher
John Wiley and Sons
Year
2002
Weight
97 KB
Volume
1
Category
Article
ISSN
1617-7061

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new result on the complexity of heuris
A new result on the complexity of heuristic estimates for the A★ algorithm
✍ Othar Hansson; Andrew Mayer; Marco Valtorta 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 736 KB

Hansson, O., A. Mayer and M. Valtorta, A new result on the complexity of heuristic estimates for the A \* algorithm, Artificial Intelligence 55 (1992) 129-143. Relaxed models are abstract problem descriptions generated by ignoring constraints that are present in base-level problems. They play an im

A robust algorithm for the solution of e
A robust algorithm for the solution of electromagnetic problems over a frequency interval via the Padé approximation
✍ Mustafa Kuzuoglu; Raj Mittra 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB 👁 2 views

In this paper, we present an efficient and systematic algorithm for the solution of electromagnetic scattering and radiation problems o¨er a wide frequency inter¨al. The algorithm is based on the e¨aluation of the Pade approximant of the solution ¨ector, constructed át a minimum number of expansion

A simpleO(n2) algorithm for the all-pair
A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph
✍ Mirchandani, Prakash 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB 👁 3 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a