✦ LIBER ✦

A unifying framework for trie design heuristics

✍ Scribed by Owen Murphy

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 556 KB
Volume: 34
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90129-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bucket elimination: A unifying framework

Bucket elimination: A unifying framework for reasoning

✍ Rina Dechter 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolution for propositional satisfiability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination

A decision-theoretic framework for compa

A decision-theoretic framework for comparing heuristics

✍ Bruce L. Golden; Arjang A. Assad 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 286 KB

A Unified Framework for Designing, Imple

A Unified Framework for Designing, Implementing and Visualizing Distributed Algorithms

✍ Michel Bauderon; Mohamed Mosbah 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

A unified framework for structure identi

A unified framework for structure identification

✍ Bruno Zanuttini; Jean-Jacques Hébrard 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 74 KB

We propose a general framework for structure identification, as defined by Dechter and Pearl. It is based on the notion of prime implicate, and handles Horn, bijunctive and affine, as well as Horn-renamable formulas, for which, to our knowledge, no polynomial algorithm has been proposed before. This

Balanced network flows. I. A unifying fr

Balanced network flows. I. A unifying framework for design and analysis of matching algorithms

✍ Fremuth-Paeger, Christian; Jungnickel, Dieter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB 👁 2 views

We discuss a wide range of matching problems in terms of a network flow model. More than this, we start up a matching theory which is very intuitive and independent from the original graph context. This first paper contains a standardized theory for the performance analysis of augmentation algorithm

A unifying framework for lossless and pr

A unifying framework for lossless and progressive image coding

✍ Amel Benazza-Benyahia; Jean-Christophe Pesquet 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 297 KB

Progressive coding is a desirable feature for image database telebrowsing or image transmissions over low bandwidth channels. Furthermore, for some applications, exact image reconstruction is required. In this paper, we show that most of the lossless and progressive coders can be described by a comm