✦ LIBER ✦

On the performance guarantee of neural networks for NP-hard optimization problems

✍ Scribed by V. Zissimopoulos

Book ID: 107766252
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 596 KB
Volume: 54
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(95)00051-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the power of neural networks for solv

On the power of neural networks for solving hard problems

✍ Jehoshua Bruck; Joseph W Goodman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 392 KB

Studying the Complexity of Global Verifi

Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems

✍ Derek E. Armstrong; Sheldon H. Jacobson 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 124 KB

Problem of optimizing the number of bloc

Problem of optimizing the number of block accesses in performing relational join is NP-hard

✍ Farshad Fotouhi; Sakti Pramanik 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 665 KB

On the complexity of test case generatio

On the complexity of test case generation for NP-hard problems

✍ Laura A. Sanchis 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Studying the performance of artificial n

Studying the performance of artificial neural networks on problems related to cryptography

✍ E.C. Laskari; G.C. Meletiou; D.K. Tasoulis; M.N. Vrahatis 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Cryptosystems rely on the assumption that a number of mathematical problems are computationally intractable, in the sense that they cannot be solved in polynomial time. Numerous approaches have been applied to address these problems. In this paper, we consider artificial neural networks and study th

Performance guarantees of greedy algorit

Performance guarantees of greedy algorithms for the problems on hereditary systems

✍ V. P. Il’ev 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 552 KB