搜索结果: 1-1 共查到“军事学 gossip”相关记录1条 . 查询时间(0.093 秒)
Given a network of n = 2^k gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper communicates (gossips) only once a day, with one other gossipe...