✦ LIBER ✦

Local search of orthogonal packings using the lower bounds

✍ Scribed by V. M. Kartak; M. A. Mesyagutov; E. A. Mukhacheva; A. S. Filippova

Book ID: 110152942
Publisher: SP MAIK Nauka/Interperiodica
Year: 2009
Tongue: English
Weight: 310 KB
Volume: 70
Category: Article
ISSN: 0005-1179
DOI: 10.1134/s0005117909060113

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New lower bounds for the three-dimension

New lower bounds for the three-dimensional orthogonal bin packing problem

✍ Liao, Chung-Shou; Hsu, Chia-Hong 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Bounds for Local Density of Sphere Packi

Bounds for Local Density of Sphere Packings and the Kepler Conjecture

✍ J. C. Lagarias 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 240 KB

New lower bounds on the cost of binary s

New lower bounds on the cost of binary search trees

✍ Roberte De Prisco; Alfredo De Santis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 674 KB

Lower bounds on the minimal delay of com

Lower bounds on the minimal delay of complex orthogonal designs with maximal rates

✍ Kan, H.; Hong Shen 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 152 KB

Upper and lower bounds for the average-c

Upper and lower bounds for the average-case complexity of path-search

✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent

Packing into the smallest square: Worst-

Packing into the smallest square: Worst-case analysis of lower bounds

✍ Alberto Caprara; Andrea Lodi; Silvano Martello; Michele Monaci 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 295 KB