✦ LIBER ✦

The complexity of partition tasks

✍ Scribed by Fernando Eesponda; Matías Vera-Cruz; Jorge Tarrasó; Marco Morales

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 175 KB
Volume: 16
Category: Article
ISSN: 1076-2787
DOI: 10.1002/cplx.20324

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semi-algebraic Complexity—Additive Compl

Semi-algebraic Complexity—Additive Complexity of Matrix Computational Tasks

✍ Thomas Lickteig; Klaus Meer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 621 KB

The parallel complexity of coarsest set

The parallel complexity of coarsest set partition problems

✍ Sang Cho; Dung T. Huynh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 497 KB

On the complexity of scheduling tasks wi

On the complexity of scheduling tasks with discrete starting times

✍ J Mark Keil 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Information and information sources in t

Information and information sources in tasks of varying complexity

✍ Katriina Byström 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 2 views

On the complexity of task allocation

✍ A. Schoneveld; J. F. de Ronde; P. M. A. Sloot 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 3 views

A detailed study is presented on the combinatorial optimization problem of allocating parallel tasks to a parallel computer. Depending on two application/machine-specific parameters, both a sequential and a parallel optimal allocation phase are shown to exist. A sudden "phase" transition is observed

On the complexity of assembly partitioni

On the complexity of assembly partitioning

✍ Lydia Kavraki; Jean-Claude Latombe; Randall H. Wilson 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 732 KB