✦ LIBER ✦

The maximum distance problem and band sequences

✍ Scribed by A. Ben-Artzi; R.L. Ellis; I. Gohberg; D.C. Lay

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 997 KB
Volume: 87
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90161-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Algorithms for the Maximum Sub

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

✍ Tadao Takaoka 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 222 KB

B2-sequences and the distinct distance c

B2-sequences and the distinct distance constant

✍ G.S Yovanof; H Taylor 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 392 KB

ferences c U -ai, i < j are distinct is called a B2-sequence. Denote by DDC (distinct difference constant) the maximum over all possible B2-sequences of the sum E(1/ai). Previously known upper and lower bounds for the DDC are 2.1597 < DDC < 2.374. We have estimated the following sharper bounds on DD

The load-distance balancing problem

✍ Edward Bortnikov; Samir Khuller; Jian Li; Yishay Mansour; Joseph Seffi Naor 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

## Abstract Problems dealing with assignment of clients to servers have been widely studied. However, they usually do not model the fact that the delay incurred by a client is a function of both the distance to the assigned server and the load on this server, under a given assignment. We study a pr

Problem-based learning and the distance-

Problem-based learning and the distance-learner

✍ Norman R Cohen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 687 KB

The maximum information principle and th

The maximum information principle and the evolution of nucleotide sequences

✍ Liaofu Luo; Guoyi Bai 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 356 KB

The probability distributions of bases in nucleotide sequences are deduced from the maximum information principle by maximizing the entropy (due to random mutation of bases) under certain constraints (Markovian entropy, G+C content, etc, due to selection). Two formulations are given with respect to

Phylogenetic diversity and the maximum c

Phylogenetic diversity and the maximum coverage problem

✍ Vincent Moulton; Andreas Spillner 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 376 KB

For a weighted hypergraph (H, ω), with vertex set X , edge set E, and weighting ω : E → R ≥0 , the maximum coverage problem is to find a k-element subset Y ⊆ X that maximizes the total weight of those edges that have non-empty intersection with Y among all k-element subsets of X . Such a subset Y is