Cover image

Normal view MARC view ISBD view

Efficient algorithms for computing optimal meeting points in the obstructed space

by Tahsina Hashem.

Publisher: Dhaka Department of Computer Science and Engineering, BUET 2017Description: xii,74 p.Subject(s): AlgorithmsOnline resources: Click here to access online

Tags from this library: No tags from this library for this title. Add tag(s)

Log in to add tags.

average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Call number	Copy number	Status	Date due	Barcode
Thesis	Central Library, BUET Reference section	006.31/TAH/2017 (Browse shelf)	1	Available		116070

Browsing Central Library, BUET Shelves , Shelving location: Reference section 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 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	006.31 /SHU/2014 Handling over-fitting and class-imbalance jointly in Pittsburgh learning classifier systems	006.31/SUM/2023 Analysis and interpretability of machine learning models to classify thyroid disease	006.31/SUR/2019 Efficient approach for finding common DNA motifs with gaps	006.31/TAH/2017 Efficient algorithms for computing optimal meeting points in the obstructed space	006.31/TAM/2021 AHP and topsis based approach to solve student-supervisor assignment problem	006.31/TAN/2022 Detection of recycled field programmable gate arrays using clustering algorithm	006.31/TAS/2018 Optimizing dominant pruning algorithm using three hop neighbor information	Next

One CD-ROM

Includes bibliographies

There are no comments for this item.

Log in to your account to post a comment.

Share