DSpace Repository

Browsing Dissertation/Theses - Department of Computer Science and Engineering by Title

Browsing Dissertation/Theses - Department of Computer Science and Engineering by Title

Sort by: Order: Results:

  • Many- objective performance optimization in heterogeneous computing clusters 
    Rizvi, A.S.M (Department of Computer Science and Engineering, 2017-07-22)
    In computing clusters, there are di erent performance metrics, which often appear to be con- icting while being attempted to be optimized. For having such con icting cases along with experiencing existence of heterogeneous ...
  • Maximizing network interruption: an intruder's perspective 
    Fariha Tasmin Jaigirdar (Department of Computer Science and Engineering (CSE), 2011-10)
    With the colossal growth of Wireless Sensor Networks (WSNs) in different applications starting from home automation to different military affairs, the pressure on ensuring security in such a network is paramount. Considering ...
  • Memory efficient data structure for static huffman tree 
    Abdullah - Al - Amin, Khondaker (Department of Computer Science and Engineering, BUET, 2007-06)
    Since the discovery of the Huffman encoding scheme in 1952, Huffman encoding scheme is widely used in text, image and video compression. Huffman coding has been subjected to numerous investigations in the past 50 years. ...
  • Metaheuristic algorithms for some knapsack variants 
    Shahrear Iqbal (Department of Computer Science and Engineering (CSE), 2011-02)
    Knapsack problems (KP) and variants thereof are classic problems in computer science with diverse applications. The knapsack problem has been used to model various decision making processes. Industrial applications find ...
  • Minimum - layer drawings of trees 
    Jawaherul Alam, Muhammad (Department of Computer Science and Engineering (CSE), 2010-07)
    A layered drawing of a planar graph G is a planar straight-line drawing of G, where the vertices are placed on a set of horizontal lines, called layers. A minimum-layer drawing of G is a layered drawing of G with the ...
  • Minimum interference path preserving and fault tolerant wireless AD hoc networks 
    Ehtesamul Haque, Md. (Department of Computer Science and Engineering, BUET, 2009-08)
    Interference is one of the major challenges in wireless networks. A wireless node a is snid to interfere node b if transmission from node a unintentionally covers node b. Interference of a link is defined as the number ...
  • Minimum segment drawings of outerplanar graphs 
    Abdullah Adnan, Muhammad (Department of Computer Science and Engineering, BUET, 2008-12)
    In a straight line drawing of a planar graph each vertex is drawn as a point and each edge is drawn as a straight line segment. One of the important aesthetic criteria for a straight line drawing is to minimize the number ...
  • Minimum segment drawings of series-parallel graphs with the maximum degree three 
    Abul Hassan Samee, Md. (Department of Computer Science and Engineering, BUET, 2008-07)
    This thesis deals with minimum segment drawings of planar graphs. A minimum segment drawing of a planar graph G is a planar straight line drawing of G that has the minimum number of line segments among all possible planar ...
  • Mining interesting rules from a large set of association rules 
    Sadi, Muhammad Sheikh (Department of Computer Science and Engineering, BUET, 2004-12)
    The goal of data mmmg IS to discover knowledge and reveal new, interesting and previously unknown information to the user. A central data-mining tool is association rules. This thesis work presents a constructive approach ...
  • Mitigating DDoS attack in named data network 
    Tumpa, Nadia Akbar (Department of Computer Science and Engineering(CSE), BUET, 2019-09-30)
    Named Data Networking is a new concept in modern internet technology instead of conventional TCP/IP architecture where nodes are addressed based on the interest of the the consumers. Internet security is a very challenging ...
  • Mobility aware data delivery in vehicular ad hoc networks 
    Muzakkir Ahmed, Syed (Department of Computer Science and Engineering (CSE), 2013-07)
    Vehicular ad hoc networks (VANETs) have received considerable attentions both from academics and industries. VANETs are promising for multi-hop data delivery between a source and a destination vehicle (or a node) because ...
  • Modeifed artificial bee colony algorithm for gene selection in classifying cancer 
    Johra Muhammad Moosa (Department of Computer Science and Engineering (CSE), 2015-08)
    Development of cancer diagnostic models by utilizing microarray data has become a topic of great interest in the eld of bioinformatics and medicine. Only a small number of gene expression data compared to the total ...
  • Model for automatic partial evaluation of SQL queries 
    Panni, Fauhat Ali Khan (Department of Computer Science and Engineering, 2018-01-28)
    Database is the core course in the study of Computer Science and Engineering. In the undergrad- uate level, one of the major topics for database is SQL. SQL-LES is a Problem-Based e-Learning (PBeL) system that has been ...
  • Modeling and predicting psychological attributes and preferences of users from social media usage 
    Mukta, Md. Saddam Hossain (Department of computer Science and Engineering, 2018-08-04)
    In recent times, Social Networking Sites (SNS) such as Facebook, Twitter, Foursquare and IMDb have become major platforms of communications for users in the web. These SNS allow a user to share ideas, thoughts, and ...
  • Modified inverted files and algorithms for phrase query and not query 
    Paul, Tuhin (Department of Computer Science and Engineering, BUET, 2009-12)
    Inverted files, equivalent to database indices, are used to speed up the search of both Hyper Text Markup Language (HTML) and eXtensible Markup Language (XML) files in the web. Searching XML files differs from that ofHTML ...
  • Modified limited data rate usage algorithm using Markovian decision process model 
    Deb, Rupam (Department of Computer Science and Engineering (CSE), 2012-05)
    The dual mode hand-held devices to connect both the wireless local area network (WLAN) and the cellular network, i.e., the universal mobile telecommunication system (UMTS), are becoming popular. Users want to make trade-off ...
  • mPlexus : An efficient and scalable peer - to - peer routing protocol for queries with partial and misspelled keywords 
    Rakibul Haque, Md. (Department of Computer Science and Engineering, BUET, 2009-08)
    Efficiently searching is the vital operation in any Peer-to-Peer (P2P) network. Users may not know about the exact keywords of their requested files in such distributed systems which causes searching using partially ...
  • Multi-level Clustering of nodes for distributed mutual exclusion 
    Ashiqur Rahman, Mohammad (Department of Computer Science and Engineering, BUET, 2007-03)
    Distributed and Parallel Systems have become attractive as well as important due to its cost effectiveness and better performance. A Distributed system is a collection of computing sites where any node has only partial ...
  • 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 ...
  • Multi-valued logic system in computer architecture 
    Mostafa Akbar, Md. (Department of Computer Science and Engineering, BUET, 1998-10-04)
    For abstracts please see full text

Search BUET IR


Advanced Search

Browse

My Account