𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the difficulty of Manhattan channel routing

✍ Scribed by Ronald Greenberg; Joseph Jájá; Sridhar Krishnamurthy

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
362 KB
Volume
44
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An application of neural networks on cha
An application of neural networks on channel routing problem
✍ Pao-Hsu Shih; Wu-Shung Feng 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 572 KB

Shih, P.-H. and W.-S. Feng, An application of neural networks on channel routing problem, Parallel Computing 17 (1991) 229-240 The channel routing problem is to make interconnections among terminals located on opposite sides of a rectangular channel. This problem has been proven to be NP-complete.

Enhancement of the channel routing modul
Enhancement of the channel routing module in SWAT
✍ Nam Won Kim; Jeongwoo Lee 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

## Abstract The objective of this study is to demonstrate that the channel flow routing techniques used in the Soil and Water Assessment Tool (SWAT) can be sometimes inappropriate for runoff simulation in small basins. Simulated hydrographs have a tendency to underestimate peak flows or may send a

On the difficulty of approximately maxim
On the difficulty of approximately maximizing agreements
✍ Shai Ben-David; Nadav Eiron; Philip M. Long 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 211 KB

We address the computational complexity of learning in the agnostic framework. For a variety of common concept classes we prove that, unless P ¼ NP; there is no polynomial time approximation scheme for finding a member in the class that approximately maximizes the agreement with a given training sam

On the Difficulty of Writing Out formal
On the Difficulty of Writing Out formal Proofs in Arithmetic
✍ Ryo Kashima; Takeshi Yamaguchi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## Abstract Let ℸ be the set of Gödel numbers Gn(__f__) of function symbols __f__ such that PRA ⊢ and let γ be the function such that We prove: (1) The r. e. set ℸ is m‐complete; (2) the function γ is not primitive recursive in any class of functions {__f__~1~, __f__~2~, ⃛} so long as each __f~i~