The exact gossiping problem for 5 messages / Jonathan T. Paredes

By:

Paredes, Jonathan T

Material type: Text

TextLanguage: English Publication details: 2001Description: 16 leavesSubject(s):

Undergraduate Thesis AMAT200

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.

List(s) this item appears in: BS Applied Mathematics

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 2 )
Comments ( 0 )
Images

Holdings
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 College of Science and Mathematics shelves, Shelving location: Theses, Collection: Room-Use Only Close shelf browser (Hides shelf browser)

Previous	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	Next
Previous	LG993.5 2000 C6 C66 Cell phone-operated remote switching of electrical devices using short message service (SMS communications /	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 2001 A64 S39 A logistic regression model to predict the Pahinungod voluntarism of the University of the Philippines Mindanao undergraduate students /	LG993.5 2001 A64 V55 An arima model on the monthly wholesale prices of corn in the Philippines (Jan 1989 - Oct 1997) /	LG993.5 2001 B4 A42 Biological attributes, parasitization rate and abundance of Trichomma Cnaphalocrosis (U.), a larval and pupal parasitoid of the Asian corn borer /	Next

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.

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer