Proceedings 15th International Conference on Information Networking
DOI: 10.1109/icoin.2001.905498
|View full text |Cite
|
Sign up to set email alerts
|

A new method for constructing efficient local coteries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…Thus, we should always concentrate on the nondominated (ND) coteries that no coterie can dominate. The local coteries constructed by the algorithms in [13] and [14] may not be ND, though.…”
Section: Nondomination Of Local Coteriesmentioning
confidence: 99%
See 3 more Smart Citations
“…Thus, we should always concentrate on the nondominated (ND) coteries that no coterie can dominate. The local coteries constructed by the algorithms in [13] and [14] may not be ND, though.…”
Section: Nondomination Of Local Coteriesmentioning
confidence: 99%
“…We also introduce Kakugawa and Yamashita's algorithm [13] and Cheng et al's algorithm [14] for constructing local coteries to solve the resource allocation problem. [8].)…”
Section: The Coterie Local Coterie and P-coteriementioning
confidence: 99%
See 2 more Smart Citations
“…There have been solutions [3,5,6,20,26] proposed for solving the distributed resource allocation problem.…”
Section: Introductionmentioning
confidence: 99%