Normal view MARC view ISBD view

A further enhancement of heap-based algorithm applied boggle server / Michael Cedrick F. de Jesus and Ramon Christian P. Salibio. 6

By: Michael Cedrick F. de Jesus and Ramon Christian P. Salibio. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; March 2016.46Edition: Description: 28 cm. 95 ppContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: ABSTRACT: An Algorithm is an effective method that can be expressed within a finite amount of space and time and there are lots of algorithm competing in terms of complexity that can cater the most efficient in speed or in memory, this implied by any game complexity results. A heap is a specialized tree-based data structure that satisfies the heap property. In this algorithm, the highest (or lowest) priority element is always stored at the root. In other programming language, when you use the new operator to allocate memory, this memory is assigned from the heap. This research paper focuses in the heap-based algorithm applied in Boggle solvers and a methods used to enhance existing search tree algorithm is presented. This also explained how this method is used for further enhancing the existing enhance algorithm. The proponents intent is to further enhance the heap-based algorithm to be able to optimize memory usage, to be able to filter invalid words according to rules of boggle puzzle, and to be able to generate succeeding words after producing words starting with the Qu. The researchers embedded the further enhance algorithm to an application to emphasize the positive effect; and concluded that the algorithm was far more efficient than the existing heap-based algorithm through the execution time of the heap elements. This algorithm also recommend to apply in other wide range category puzzles (board/word) such as scrabble game, chess game, etc. Other editions:

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

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Archives	Filipiniana-Thesis	QA76.9 .A43 D44 2016 (Browse shelf)	Available		FT6067

Total holds: 0

Browsing PLM Shelves , Shelving location: Archives , Collection code: Filipiniana-Thesis Close 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	QA76.9.A43 C33 2016 An enhancement of ant colony algorithm applied in automatic exam generation /	QA76.9.A43 C39 2016 An enhancement dbscan algorithm applied to faculty performance evaluation	Qa76.9 A43 C83 2008 The Enhancement of the adaptive large neighborhood search algorithm for solving the delivery problems	QA76.9 .A43 D44 2016 A further enhancement of heap-based algorithm applied boggle server /	QA76.9.A43 H47 2016 An enhancement of Spotify's music shuffling algorithm applied in spotify's music player /	QA76.9.A43 M36 2005 An enhancement of the image warping algorithm /	QA76.9 A78 2011 Sales, Purchasing and inventory system ( marketing purchasing and warehouse departmane , paint plas corporation)	Next

Undergraduate Thesis: (BSCS major in Computer Studies) - Pamantasan ng Lungsod ng Maynila, 2016. 56

ABSTRACT: An Algorithm is an effective method that can be expressed within a finite amount of space and time and there are lots of algorithm competing in terms of complexity that can cater the most efficient in speed or in memory, this implied by any game complexity results. A heap is a specialized tree-based data structure that satisfies the heap property. In this algorithm, the highest (or lowest) priority element is always stored at the root. In other programming language, when you use the new operator to allocate memory, this memory is assigned from the heap. This research paper focuses in the heap-based algorithm applied in Boggle solvers and a methods used to enhance existing search tree algorithm is presented. This also explained how this method is used for further enhancing the existing enhance algorithm. The proponents intent is to further enhance the heap-based algorithm to be able to optimize memory usage, to be able to filter invalid words according to rules of boggle puzzle, and to be able to generate succeeding words after producing words starting with the Qu. The researchers embedded the further enhance algorithm to an application to emphasize the positive effect; and concluded that the algorithm was far more efficient than the existing heap-based algorithm through the execution time of the heap elements. This algorithm also recommend to apply in other wide range category puzzles (board/word) such as scrabble game, chess game, etc.

There are no comments for this item.

to post a comment.