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

  • 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, ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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, ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Tamjidul Hoque, Md. (Department of Computer Science and Engineering, BUET, 2002-07)
    This research work has been aimed at designing and developing a BangIa Spell Checker. Use of different forms of same letter with different set of rules in BangIa, makes the straightforward development of the BangIa Speller ...
  • Farhad, S.M. (Department of Computer Science and Engineering, BUET, 2007-09)
    Multicast Video-on-Demand (VoD) systems are scalable and cheap-to-operate. In such systems, a single stream is shared by a batch of common user requests. In this research, we adapt multicast communication technique in ...
  • Tanvir Parvez, Mohammad (Department of Computer Science and Engineering, BUET, 2006-03)
    Generating all triangulations of graphs and polygons have many applications in Computational Geometry, VLSI Floorplaning and Graph Drawing. In this thesis, we deal with the problem of generating all triangulations of ...
  • Jahidul Islam, Md. (Department of Computer Science and Engineering, 2015-02)
    This thesis presents a novel hybrid dynamic spectrum access technique for multi-channel single-radio cognitive radio networks. Existing classical and stochastic approaches exhibit di erent advantages and disadvantages ...
  • Muhibur Rasheed, Md. (Department of Computer Science and Engineering, BUET, 2008-07)
    Recently several researchers have formulated the competitive facility location problem through Voronoi diagrams where a new site is placed in such a location that its Voronoi region is maximized. One notable result gives ...
  • Suman Ahmmed (Department of Computer Science and Engineering, BUET, 2006-02)
    Artificial neural networks (ANNs) are complex and useful problem solvers. Architecture determination of ANN is an important issue for the successful application of ANNs in many practical problems. It is well known that ...
  • Humayun, S.M. (Department of Computer Science and Engineering, BUET, 1994-08)
    In recent years BangIa has been being used in computers. For efficient use of this language in computers it is very important to be able to store texts economically so that in terms of both storage requirement and ...
  • Shohrab Hossain, Md. (Department of Computer Science and Engineering, BUET, 2007-01)
    The basic principles of evolution have been applied to the solution of technical problems in a wide range of domains. To successfully apply evolutionary algorithms to these increasingly complex problems, we must develop ...
  • Rakib Hassan, Md. (Department of Computer Science and Engineering, BUET, 2007-06)
    ACO algorithms are a new branch of swarm intelligence. ACO algorithms have been introduced in the last decade. They have been applied to solve different combinatorial optimization problems successfully. Their performance ...

Search BUET IR


Advanced Search

Browse

My Account