<cite id="d9bzp"></cite>
<cite id="d9bzp"><span id="d9bzp"></span></cite>
<cite id="d9bzp"><video id="d9bzp"></video></cite><var id="d9bzp"></var>
<var id="d9bzp"><video id="d9bzp"><thead id="d9bzp"></thead></video></var>
<menuitem id="d9bzp"><video id="d9bzp"></video></menuitem>
<var id="d9bzp"></var><cite id="d9bzp"><video id="d9bzp"></video></cite>
<cite id="d9bzp"></cite>
<var id="d9bzp"></var>
<var id="d9bzp"></var>
<var id="d9bzp"><video id="d9bzp"><thead id="d9bzp"></thead></video></var>


时间:2017-08-11 数学毕业论文 我要投稿





Company for farsighted program, will launch some have results to show a fruit discussion meeting, but because of company to group discussion the personnel dont all assign, causing to is some have the discussion that the shadow of human figure of the power and influence rings an excellent result, so average allotment group discussion the personnel is very important
In this paper,we solve the problem to design to assignments of several sessions with a different mix of people in each group .
We use a( 0 ,1 )-matrix C to record designed groups ,and a matrix T to record currently known times of every two members’ discussions. After concluding that the optimal attending times of each member are 6, we construct orthogonal Latin Squares to obtain the morning list. For the afternoon list, we use the ideas of Greedy Algorithm. According to the designed assignments, we design the current discussion group most efficiently.
Furthermore, we perform computer simulation to indicate that the model makes sense. We summarize a set of general and practicable schemes. In generalization, we estimate the proper range by the empirical formular for a given number of members.
The metod can be widely applied to experimental design.

Key words :Greedy Algorithm;Assign list;Orthogonal Latin Square.

云南快乐十分哪个好_北京pK怎么玩-湖北快3怎么玩 崔雪莉| 海康威视| 翻译| 翻译| 哪吒之魔童降世| 夜线| 西班牙人| iu为雪莉守灵| 中甲积分榜| 龙妈谈权游结局|