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

  • Recurring multistage evolutionary system for balancing exploration and exploration 
    Shafiul Alam, Mohammad (Department of Computer Science and Engineering, BUET, 2007-01)
    Maintaining proper balance between exploitative and explorative operations of an evolutionary algorithm is essential for preventing premature convergence to local optima and for sustaining sufficient convergence speed ...
  • Computing B-drawings of 2-outerplane graphs 
    Tanvir Irfan, Mohammad (Department of Computer Science and Engineering, BUET, 2006-12)
    One of the relatively new graph drawing problems is the proximity drawing of graphs. A proximity drawing of a plane graph G is a straight-line drawing of G with the additional geometric constraint that two vertices of G ...
  • On the longest vulnerable path inside sensor networks from boundary regions 
    Sayeed Hyder, Chowdhury (Department of Computer Science and Engineering, BUET, 2009-01)
    One of the most fundamental problems in wireless sensor network is coverage problem. Higher coverage contributes to improving the quality of services provided by a sensor network. Many researchers are putting their efforts ...
  • Design and development of an information management system 
    Abdul Mannan, Mohammad (Department of Computer Science and Engineering, BUET, 1993-03)
    This thesis presents a compete analysis. design and development of an information management system [ 1MB ]. The existing manual information system is analyzed, different solutions with performance and costing are ...
  • Design and analysis of computer based argumentation from categorical propositions 
    Nazmul Haque, Md. (Department of Computer Science and Engineering, BUET, 1987-04)
    The representation and solution of syllogistic arguments have been studied and finally, a model which can represent arguments conveniently and solve them to bring conclusion with the help of computer, has been prepared. The ...
  • Recognition of Bangla hand written characters using pattern recognition techniques 
    Fuad Rezaur Rahman, Ahmad (Department of Computer Science and Engineering, BUET, 1994-09)
    This thesis deals with the development of a Bengali character recognition system. Very few investigations have been conducted in this direction so far. The main philosophy of the technique is to obtain a correspondence ...
  • Improved TCP congestion control algorithm for wireless networks 
    Ahmed Khurshid (Department of Computer Science and Engineering, BUET, 2008-05)
    Transmission Control Protocol (TCP) congestion control algorithm deals with reducing the network load during congestion for achieving beller throughput. It rcduces the transmission window size after a rctransmission ...
  • Evolutionary algorithm based synthesis of multi-output ternary functions using quantum cascades 
    Mujibur Rahman Khan, Md. (Department of Computer Science and Engineering, BUET, 2005-06)
    Quantum Computers, which run according to to the laws of quantum mechanics, are said to be the future of today's computers. They might have exponentially more computational efficiency than any classical one. The fact ...
  • Algorithm to extract rules from artificial neural networks 
    Kamruzzaman, S.M. (Department of Computer Science and Engineering, BUET, 2005-03)
    A new rule extraction algorithm, called rule extraction from artificial neural networks (REANN) is proposed and implemented to extract symbolic rules from ANNs. A standard three-layer feedforward ANN is the basis of the ...
  • Computing nice projections of 2D and 3D scene 
    Shahriar Nirjon, S.M. (Department of Computer Science and Engineering, BUET, 2008-07)
    Computing nice projections of objects in 2D and 3D is a well studied problem in computational geometry. By nice projections we mean optimal projections having some special geometric property. Aside from theoretical interest, ...
  • Parallel algorithm of heuristic for the multiple-choise multi-dimension knapsack problem 
    Waselul Haque Sadid, Md. (Department of Computer Science and Engineering, BUET, 2005-10)
    Multiple-Choice Multi-Dimension Knapsack Problem (MMKP) is a variant of the classical 0-1 Knapsack Problem. It has a knapsack with a multidimensional capacity constraint and groups of items where each item having a utility ...
  • Resource partitioning on planar graphs 
    Tanveer Awal (Department of Computer Science and Engineering, BUET, 2007-11)
    Numerous applications of resource partitioning have been found in electrical power distribution systems, telecommunication networks, computer networks, fault tolerant systems, grid computing etc. The resource partitioning ...
  • Approximation algorithm for edge-ranking of series-parallel graphs 
    Tanzima Hashem (Department of Computer Science and Engineering, BUET, 2006-06)
    This thesis deals with an approximation algorithm for finding edge-rankings of series-parallel graphs. An edge-ranking of a graph G is a labeling of its edges with positive integers such that every path between two edges ...
  • Software reliability using markov chain usage model 
    Shazzad Hosain, Md. (Department of Computer Science and Engineering, BUET, 2005-08)
    Statistical testing gIves us opportunity to have statistical inferences such as reliability, mean time to failure (MTTF) etc. for software systems and Markov chain usage model gams it's credibility in this field. Markov ...
  • General purpose simulator for network on chip 
    Hemayet Hossain (Department of Computer Science and Engineering, BUET, 2005-07)
    It is predicted that future integrated circuits that will contain more than one billion transistors will allow much more complex designs than possible today. System on Chip (SoC) design involves the integration of such ...
  • Hardness of finding minimum face-spanning subgraphs of plane graphs 
    Mostafa Ali Patwary, Md. (Department of Computer Science and Engineering, BUET, 2006-11)
    In this research work, we have introduced a new graph problem namely "minimum facespanning subgraph problem". Let G be an edge weighted connected plane graph, let V (G) and E( G) be the set of vertices and edges, ...
  • Simple linear algorithm for no-bend orthogonal drawings of series-parallel graphs 
    Shahidul Islam, Md. (Department of Computer Science and Engineering, BUET, 2007-11)
    This thesis deals with no-bend orthogonal drawings of series-parallel graphs. A no-bend orthogonal drawing of a series-parallel graph is a drawing, in which each vertex is drawn as a point, each edge is drawn as a single ...
  • Bi-Chromatic point set embeddings of trees with fewer bends 
    Khaled Mahmud Shahriar (Department of Computer Science and Engineering, BUET, 2008-03)
    Let G be a planar graph such that each vertex in G is colored by either red or blue color. Assume that there are nr red vertices and nb blue vertices in G. Let 8 be a set of fixed points in the plane such that 181 = nr ...
  • Efficient information retrieval system for Bangla text database 
    Amir Sharif, Mohammad (Department of Computer Science and Engineering, BUET, 2006-11)
    The amount of information available in electronic form is growmg exponentially, making it increasingly difficult to find the desired information. Information retrieval is primarily conccrned with the storage and retrieval ...
  • Parallel algorithms for matrix multiplication 
    Mandal, Bikash Chandra (Department of Computer Science and Engineering, BUET, 1999-12)
    During the last two decades tremendous success has been achieved in the PC based computing. Most of the PCs are now as powerful as the mid-range/mini computers of early sixties and seventies. Improvement in the cost ...

Search BUET IR


Advanced Search

Browse

My Account