✦ LIBER ✦

Geometric characterization of capacity-constraint function

✍ Scribed by Nakagawa, K.; Kanaya, F.

Book ID: 114540000
Publisher: IEEE
Year: 1989
Tongue: English
Weight: 358 KB
Volume: 35
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.32168

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of single semiflexible

Characterization of single semiflexible filaments under geometric constraints

✍ S. Köster; J. Kierfeld; T. Pfohl 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 409 KB

Constraint Sets of Geometric Programs Ch

Constraint Sets of Geometric Programs Characterized by Auxiliary Problems

✍ Gochet, Willy; Smeers, Yves 📂 Article 📅 1975 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 817 KB

A new geometric capacity characterizatio

A new geometric capacity characterization of a discrete memoryless channel

✍ Nakagawa, K.; Kanaya, F. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 375 KB

Network characterization using constrain

Network characterization using constraint-based definitions of capacity, utilization, and efficiency

✍ Yegenoglu, F.; Sherk, E. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 175 KB

Coalition-proof supply function equilibr

Coalition-proof supply function equilibria under capacity constraints

✍ Juan Delgado 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 142 KB

Revisiting decomposition analysis of geo

Revisiting decomposition analysis of geometric constraint graphs

✍ R. Joan-Arinyo; A. Soto-Riera; S. Vila-Marta; J. Vilaplana-Pastó 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 651 KB

Geometric problems defined by constraints can be represented by geometric constraint graphs whose nodes are geometric elements and whose arcs represent geometric constraints. Reduction and decomposition are techniques commonly used to analyze geometric constraint graphs in geometric constraint solvi