The Complexity of Partition Tasks

被引：2
|
作者：
Esponda, Fernando [1 ]
Vera-Cruz, Matias
Tarraso, Jorge
Morales, Marco
机构：
[1] Inst Tecnol Autonomo Mexico, Dept Comp Sci, Mexico City, DF, Mexico
来源：
COMPLEXITY | 2010年 / 16卷 / 01期
关键词：
agent synchronization; partition tasks; task complexity; El Farol; SELF-ORGANIZATION; INFORMATION;
D O I：
10.1002/cplx.20324
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this article, we introduce the partition task problem class along with a complexity measure to evaluate its instances and a performance measure to quantify the ability of a system to solve them. We explore, via simulations, some potential applications of these concepts and present some results as examples that highlight their usefulness in policy design scenarios, where the optimal number of elements in a partition or the optimal size of the elements in a partition must be determined. (C) 2010 Wiley Periodicals, Inc. Complexity 16: 56-64, 2010
引用
收藏
页码：56 / 64
页数：9
相关论文
共 50 条
  • [21] UNLABELED PARTITION SYSTEMS - OPTIMIZATION AND COMPLEXITY
    CAMERINI, PM
    MAFFIOLI, F
    SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03): : 426 - 441
  • [22] A Complexity Dichotomy For Hypergraph Partition Functions
    Dyer, Martin
    Goldberg, Leslie Ann
    Jerrum, Mark
    COMPUTATIONAL COMPLEXITY, 2010, 19 (04) : 605 - 633
  • [23] Complexity and approximation of Satisfactory Partition problems
    Bazgan, C
    Tuza, Z
    Vanderpooten, D
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 829 - 838
  • [24] On multi-partition communication complexity
    Duris, P
    Hromkovic, J
    Jukna, S
    Sauerhoff, M
    Schnitger, G
    INFORMATION AND COMPUTATION, 2004, 194 (01) : 49 - 75
  • [25] On the complexity of graph tree partition problems
    Cordone, R
    Maffioli, F
    DISCRETE APPLIED MATHEMATICS, 2004, 134 (1-3) : 51 - 65
  • [26] The complexity of the list partition problem for graphs
    Cameron, Kathie
    Eschen, Elaine M.
    Hoang, Chinh T.
    Sritharan, R.
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (04) : 900 - 929
  • [27] A Complexity Dichotomy For Hypergraph Partition Functions
    Martin Dyer
    Leslie Ann Goldberg
    Mark Jerrum
    computational complexity, 2010, 19 : 605 - 633
  • [28] PARTITION COMPLEXITY IN A NETWORK OF CHAOTIC ELEMENTS
    KANEKO, K
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1991, 24 (09): : 2107 - 2119
  • [29] Partition arguments in multiparty communication complexity
    Draisma, Jan
    Kushilevitz, Eyal
    Weinreb, Enav
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (24) : 2611 - 2622
  • [30] Effects of incorporating retrieval into learning tasks: The complexity of the tasks matters
    Roelle, Julian
    Berthold, Kirsten
    LEARNING AND INSTRUCTION, 2017, 49 : 142 - 156
12345