✦ LIBER ✦

A note on hop-constrained walk polytopes

✍ Scribed by Geir Dahl; Njål Foldnes; Luis Gouveia

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 194 KB
Volume: 32
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2003.10.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the edge-disjoint 2-hop-constrained p

On the edge-disjoint 2-hop-constrained paths polytope

✍ Geir Dahl; David Huygens; A. Ridha Mahjoub; Pierre Pesneau 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 166 KB

A note on node packing polytopes on hype

A note on node packing polytopes on hypergraphs

✍ Yasuki Sekiguchi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 524 KB

A note on constrained OWA aggregation

✍ Christer Carlsson; Robert Fullér; Péter Majlender 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 189 KB

A note on the maximum of a random walk

✍ W. Stadje 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 164 KB

A note on constrained k-means algorithms

✍ Michael K. Ng 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 102 KB

This paper describes extensions to the k-means algorithm for clustering data sets. By adding suitable constraints into the mathematical program formulation, an approach is developed, which allows the use of the k-means paradigm to e$ciently cluster data sets with the "xed number of objects in each c

A note on vertex-reinforced random walks

✍ Jack Jie Dai 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 195 KB

A vertex-reinforced random walk on Z with exactly ÿve points in its essential range exhibits the behavior described by Theorem 1.3 of Pemantle and Volkov (Ann. Probab. 27 (1999) 1368) almost surely.