The exact gossiping problem for 5 messages / Jonathan T. Paredes
Material type:
TextLanguage: English Publication details: 2001Description: 16 leavesSubject(s): Dissertation note: Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2001 Abstract: This paper studies a variation of the gossiping problem, where there are n persons, each of whom initially has a unique message. A pair of persons can pass to each other all the messages they have by making one telephone call. The exact gossiping problem is to determine the minimum number E(n,k) of calls for each of the n persons to know exactly k messages. Chang and Tsay (1995) studied and gave a solution to E(n,k) for k 4 based from earlier studies done by Richards and Liestman (1988) on partial gossiping. This is an extension of Chang and Tsay's paper where the methods and techniques used by then were utilized for k=5. The study was to obtain the minimum number of E(n,k) calls required for each person to know exactly k messages, for k = 5 only, for all values of n.
| Cover image | Item type | Current library | Collection | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
|
|
University Library Theses | Room-Use Only | LG993.5 2001 A64 P37 (Browse shelf(Opens below)) | Not For Loan | 3UPML00010963 | ||
|
|
University Library Archives and Records | Preservation Copy | LG993.5 2001 A64 P37 (Browse shelf(Opens below)) | Not For Loan | 3UPML00020927 |
Browsing University Library shelves, Shelving location: Archives and Records, Collection: Preservation Copy Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | ||
| LG993.5 2001 A64 B33 A mathematical model for computing water consumption based on billing information / | LG993.5 2001 A64 G45 A deterministic inventory model with multiple price breaks / | LG993.5 2001 A64 P33 A conditional randomized algorithms for university timetabling of teachers / | LG993.5 2001 A64 P37 The exact gossiping problem for 5 messages / | LG993.5 2002 A64 B65 A mathematical model for the assessment and monitoring of the impact of special program for employment of students (SPES) / | LG993.5 2002 A64 D45 A winning strategy for the Dama game / | LG993.5 2002 A64 G35 A winning strategy for a Mancala Game / |
Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2001
This paper studies a variation of the gossiping problem, where there are n persons, each of whom initially has a unique message. A pair of persons can pass to each other all the messages they have by making one telephone call. The exact gossiping problem is to determine the minimum number E(n,k) of calls for each of the n persons to know exactly k messages. Chang and Tsay (1995) studied and gave a solution to E(n,k) for k 4 based from earlier studies done by Richards and Liestman (1988) on partial gossiping. This is an extension of Chang and Tsay's paper where the methods and techniques used by then were utilized for k=5. The study was to obtain the minimum number of E(n,k) calls required for each person to know exactly k messages, for k = 5 only, for all values of n.
Click on an image to view it in the image viewer
There are no comments on this title.