✦ LIBER ✦

On Obtaining Separating Hyperplanes via Linear Programming

✍ Scribed by Martin, W. C.

Book ID: 114669609
Publisher: Institute of Electrical and Electronics Engineers
Year: 1971
Weight: 361 KB
Volume: SMC-1
Category: Article
ISSN: 0018-9472
DOI: 10.1109/tsmc.1971.5408612

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Hyperplanes of the Taylor-Steinbu

On the Hyperplanes of the Taylor-Steinbuch Linear Separator

✍ Sandoval, Victor H. 📂 Article 📅 1966 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 188 KB

Further asymptotic size Ramsey results o

Further asymptotic size Ramsey results obtained via linear programming

✍ Oleg Pikhurko 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Upper Bounds on Permutation Codes via Li

Upper Bounds on Permutation Codes via Linear Programming

✍ H. Tarnanen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

Upper Bounds on Permutation Codes via Li

Upper Bounds on Permutation Codes via Linear Programming

✍ H. Tarnanen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

An upper bound on permutation codes of length n is given. This bound is a solution of a certain linear programming problem and is based on the well-developed theory of association schemes. Several examples are presented. For instance, the 255 values of the bound for n ≤ 8 are tabulated. It turns out

On -diagnosability of Petri nets via int

On -diagnosability of Petri nets via integer linear programming

✍ F. Basile; P. Chiacchio; G. De Tommasi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 468 KB

Branching on hyperplane methods for mixe

Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices

✍ Sanjay Mehrotra; Zhifeng Li 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 789 KB