𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The dynamic predicate stashing copy problem

✍ Scribed by Brunilde Sansó; François Soumis

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
840 KB
Volume
23
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

High-resolution copy number arrays in ca
High-resolution copy number arrays in cancer and the problem of normal genome copy number variation
✍ Kylie L. Gorringe; Ian G. Campbell 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 424 KB

## Abstract High‐resolution techniques for analysis of genome copy number (CN) enable the analysis of complex cancer somatic genetics. However, the analysis of these data is difficult, and failure to consider a number of issues in depth may result in false leads or unnecessary rejection of true pos

Solving the dynamic facility location pr
Solving the dynamic facility location problem
✍ Chardaire, Pierre; Sutter, Alain; Costa, Marie-Christine 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

This paper addresses with the multiperiod, or dynamic, uncapacited facility location problem (DUFLP): The demand varies between time periods and the solution should answer the questions of where and when to establish facilities. We modelize the problem as a 0-1 quadratic program and, since the DUFL

Dynamic analysis methods for the year 20
Dynamic analysis methods for the year 2000 problem
✍ Wilde, Norman; Justice, Randy; Blackwell, Kristin; Wong, W. Eric 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 2 views

Programmers working on the year 2000 problem need to locate and understand date sensitive code, that is, code whose execution depends on date inputs. This paper presents several dynamic analysis methods for addressing this problem. Date sensitive code can be located by running many test cases that a

Dynamic programming approaches to the mu
Dynamic programming approaches to the multiple criteria knapsack problem
✍ Kathrin Klamroth; Margaret M. Wiecek 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 2 views

We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul