✦ LIBER ✦

On Search Times for Early-Insertion Coalesced Hashing

✍ Scribed by Pittel, Boris; Yu, Jenn-Hwa

Book ID: 118174154
Publisher: Society for Industrial and Applied Mathematics
Year: 1988
Tongue: English
Weight: 970 KB
Volume: 17
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0217029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The effect of deletions on different ins

The effect of deletions on different insertion disciplines for hash tables (Extended Abstract)

✍ Patricio V. Poblete; Alfredo Viola 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Search Games on Trees with Asymmetric Tr

Search Games on Trees with Asymmetric Travel Times

✍ Alpern, Steve 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 294 KB

On an Early Search for Winnecke's Comet

On an Early Search for Winnecke's Comet before Perihelion

✍ E. E. Barnard 📂 Article 📅 1891 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB

Evidence for Early closure Attachment on

Evidence for Early closure Attachment on First pass Reading Times in French

✍ Zagar, Daniel; Rativeau, Joel Pynte & Sylvie 📂 Article 📅 1997 🏛 Taylor and Francis Group 🌐 English ⚖ 289 KB

Variable neighborhood search approaches

Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times

✍ Rene Driessel; Lars Mönch 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 377 KB

A note on “Beam search heuristics for th

A note on “Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”

✍ F. Della Croce; E. Desmier; T. Garaix 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 171 KB

In a recent paper by Valente ''Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time" ', Computers & Industrial Engineering, 55, 663-675, 2008, several beam search approaches are compared on a large set of instances of the total weighted earlinesstard