𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast Turing Reductions of Combinatorial Problems and Their Algorithms

✍ Scribed by A. K. DEWDNEY

Book ID
119863008
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
533 KB
Volume
555
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algorithms for searching explicit AND/OR
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
✍ P.P. Chakrabarti πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 756 KB

Chakrabarti, P.P., Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Artificial Intelligence 65 (1994) 329-345. We present algorithms for finding out optimal cost solutions of an explicit AND/OR graph. We show that these new algorithms can work on A

Vibration of fast trains, palindromic ei
Vibration of fast trains, palindromic eigenvalue problems and structure-preserving doubling algorithms
✍ Eric King-Wah Chu; Tsung-Min Hwang; Wen-Wei Lin; Chin-Tien Wu πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 368 KB

The vibration of fast trains is governed by a quadratic palindromic eigenvalue problem Accurate and efficient solution can only be obtained using algorithms which preserve the structure of the eigenvalue problem. This paper reports on the successful application of the structure-preserving doubling