Dissertations/Theses - Department of Computer Science and Engineering: Recent submissions

  • Multi-processor based heuristic for multidimensional multiple-choise knapsack problem 
    Abu Zafar Mohammad Shahriar (Department of Computer Science and Engineering, BUET, 2004-03)
    In this thesis we have devised a multi-processor based heuristic algorithm for the Multi-dimensional Multiple Choice Knapsack Problem (MMKP). MMKP is a variation of the classical 0-1 Knapsack Problem where there are ...
  • Linear time algorithms for floor-planning and routing problems 
    Azad, A. K. M. (Department of Computer Science and Engineering, BUET, 2005-08)
    The designer of an integrated circuit (IC) transforms a circuit description to a geometric description, called the VLSI layout. The task of converting the specification of an electrical circuit into a layout is called ...
  • Optimal contention window setting based on packet size distribution for error prone channel 
    Farah Tanjeem (Department of Computer Science and Engineering, 2014-09)
    Ad Hoc Network is a decentralized type of network where wireless devices are allowed to discover each other and communicate in peer to peer fashion without involving central access points. In most ad hoc networks, nodes ...
  • Agent-based model for malaria: examining the impact of existing and novel vector control interventions 
    Zahangir Alam, Md. (Department of Computer Science and Engineering, 2014-10)
    Malaria is a mosquito-borne infectious disease. It is transmitted among humans through female Anopheles mosquitoes. Anopheles vagus (in short An. vagus), one of the major mosquitoes (referred to as vectors in Malaria ...
  • Dynamic probabilistic broadcast for MANETs 
    Fatema Tuz Zohra (Department of Computer Science and Engineering, 2014-11)
    Self-pruning broadcasting algorithm exploits neighbor knowledge to reduce redundant retransmissions in mobile ad hoc wireless networks (MANETs). Although in self- pruning, only a subset of nodes forward the message based ...
  • Consensus string matching problem and the diagnosis of allelic heterogeneity 
    Fatema Tuz Zohora (Department of Computer Science and Engineering, 2014-10)
    The consensus problems in strings is motivated by the requirement of nding commonality of a large number of strings and has a variety of applications in Bioinformatics. This thesis presents important theoretical and ...
  • Protein folding in HP model on hexagonal prism lattice with diagonals 
    Shaw, Dipan Lal (Department of Computer Science and Engineering, 2014-09)
    The protein folding problem consist in nding the primary structure or native conformation of a protein from its amino acid sequence. It is one of the most studied computational problems in Bioinformatics and Computational ...
  • Approximation algorithms for protein folding in 2D lattice for the HP model 
    Sohidull Islam, A. S. M. (Department of Computer Science and Engineering, 2014-04)
    Three dimensional structure prediction of a protein from its amino acid sequence, known as protein folding, is one of the most studied computational problem in bioinformatics and computational biology. Since, this is a ...
  • On Pairwise Compatibility Graphs 
    Md. Shamsuzzoha Bayzid (Department of Computer Science and Engineering, 2010-06)
    This thesis deals with pairwise compatibility graphs. Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T, and let dmin and dmax be two non-negative real ...

Search BUET IR


Advanced Search

Browse

My Account