✦ LIBER ✦

Finite approximants of compact totally disconnected machines

✍ Scribed by A. R. Bednarek; A. D. Wallace

Publisher: Springer
Year: 1967
Tongue: English
Weight: 512 KB
Volume: 1
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01703819

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inverse limits and embedding of compact

Inverse limits and embedding of compact totally disconnected machines

✍ Eugene Michael Norris 📂 Article 📅 1971 🏛 Springer 🌐 English ⚖ 427 KB

The direction of an automorphism of a to

The direction of an automorphism of a totally disconnected locally compact group

✍ Udo Baumgartner; George A. Willis 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 French ⚖ 365 KB

Embedding of nonlinear dynamical systems

Embedding of nonlinear dynamical systems with compact and totally disconnected domains into the product symbolic dynamical systems

✍ Shigeo Akashi 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 99 KB

On the compactness of constant mean curv

On the compactness of constant mean curvature hypersurfaces with finite total curvature

✍ Manfredo P. do Carmo; Leung-Fu Cheung; Walcy Santos 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 80 KB

Performance approximation of re-entrant

Performance approximation of re-entrant lines with unreliable exponential machines and finite buffers

✍ Yang Liu; Jingshan Li; Shu-Yin Chiang 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 305 KB

Approximation algorithms for minimizing

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re