✦ LIBER ✦

A new approach to binary tree-based heuristics

✍ Scribed by J. Zupan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Ordering Heuristics in Binary

✍ Yuchang Mo; Farong Zhong; Huawen Liu; Quansheng Yang; Gang Cui 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB

BDD-based heuristics for binary optimiza

✍ Bergman, David; Cire, Andre A.; Hoeve, Willem-Jan; Yunes, Tallys 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 508 KB

A heuristic-based approach to conceptual

✍ Yih Tng Chong; Chun-Hsien Chen; Kah Fai Leong 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 600 KB

A case-based approach to heuristic plann

✍ Rosa, Tomás; García-Olaya, Angel; Borrajo, Daniel 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 911 KB

The analysis of a fringe heuristic for b

✍ Patricio V Poblete; J.Ian Munro 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Reachability trees for Petri nets: a heu

✍ G. Uma; B.E. Prasad 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 310 KB