✦ LIBER ✦

A compact hash function for paths in PERT networks

✍ Scribed by Vidyadhar G. Kulkarni

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 184 KB
Volume: 3
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(84)90005-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The most critical path in a PERT network

The most critical path in a PERT network: A heuristic approach

✍ H.M. Soroush 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 913 KB

Derivation of a distributed algorithm fo

Derivation of a distributed algorithm for finding paths in directed networks

✍ Robert McCurley; Fred B. Schneider 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 453 KB

A utility measure for finding multiobjec

A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks

✍ Paola Modesti; Anna Sciomachen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 334 KB

In this paper we study the problem of ®nding Origin±Destination (O±D) shortest paths in urban multimodal transportation networks, aiming at minimizing the overall cost, time and users' discommodity associated with the required paths. We present an approach based on the classical shortest path proble

An algorithm for enumerating all simple

An algorithm for enumerating all simple paths in a communication network

✍ R.B. Misra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 235 KB

Hash browns for breakfast, baked potatoe

Hash browns for breakfast, baked potatoes for dinner: Changes in food attitudes as a function of motivation and context

✍ Shelley N. Aikman; Stephen L. Crites Jr 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

A basic requirement for the policing fun

A basic requirement for the policing function in ATM networks

✍ Fabrice Guillemin; Alain Dupuis 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 685 KB