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:

  • Obstacle-free trajectory planning of a three-axis articulated robot for pick-and-place operation 
    Siddique, M. N. H. (Department of Computer Science and Engineering, BUET, 1995-11)
    Most industrial applications require a robot to move materials, parts etc. from one place to another within the workspace of the robot. Again there may be mul tip 1e objects within the work space. In such case an obstacle ...
  • Obstructed group nearest neighbor queries in spatial databases 
    Nusrat Sultana (Department of Computer Science and Engineering (CSE), 2014-07)
    A group nearest neighbor (GNN) query is an important class of information and enquiry services. Researchers have focused on developing e cient algorithms to evaluate variant of GNN queries in recent years. In this thesis, ...
  • On approaches to detect optimal keep-alive interval of TCP connection 
    Saifur Rahman, Mohammad (Department of Computer Science and Engineering (CSE), 2014-05)
    When a TCP connection between a client behind a NAT and a server is idle for a long time, it may get torn down due to TCP binding timeout. In order to keep the connection alive, the client device needs to send keep-alive ...
  • On demand media content retrieval for distant healthcare through mhealth 
    Sadia Shamma (Department of Computer Science and Engineering (CSE), 2016-09)
    This thesis proposes a patient's health data acquisition system for community health care through mHealth. In this system, patients gather in a community clinic where an attend• ing health worker records patient ...
  • 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 ...
  • On st-orientations and st-numberings of planar graphs 
    Paul, Utpal Kumar (Department of Computer Science and Engineering, BUET, 2007-07)
    An st-graph is a directed, acyclic graph with a single source s and a single sink t. An st-orientation of a graph G is an assignment of directions to its edges such that G becomes an st-graph. An st-numbering of a ...
  • 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 ...
  • Online algorithms for facility assignment problem 
    Abu Reyan Ahmed (Department of Computer Science and Engineering (CSE), 2016-07)
    Consider an online facility assignment problem where a set of facilities F of equal capacity l is situated on a metric space and customers arrive one by one in an online manner on that space. We assign a customer ci to ...
  • Online microcomputer control of multivariable system for chemical process 
    Zahidur Rahman, Mohammad (Department of Computer Science and Engineering, BUET, 1989-12)
    For abstracts please see full text
  • Ontology matching by applying parallelization and distribution of matching task within clustering environment 
    Mittra, Tanni (Department of Computer Science and Engineering (CSE), 2015-09)
    Recent advances in information and communication technology make huge amount of heterogeneous information available for us. But semantically integration of information and provide machine understandable meaning to ...
  • 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 ...
  • Optimal placement of unique restriction sites in synthetic genomes 
    Mahfuza Sharmin (Department of Computer Science and Engineering (CSE), 2012-07)
    There has been a number of research that has investigated the function of genes in a sequence and how to synthesize genome sequence according to user specification. The purpose of this thesis is to find a genome sequence ...
  • Optimal realization of Bengali key-board and character encoding for computer applications 
    Mozammel Huq Azad Khan, Md. (Department of Computer Science and Engineering, BUET, 1986-10)
    For abstracts please see full text
  • Optimal route and intermediate stops of a vehicle for a group of users in a road network 
    Reza, Radi Muhammad (Department of Computer Science and Engineering, 2017-06-20)
    Recently, with the advancement of the GPS-enabled cellular technologies, the location-based services (LBS) have gained in popularity. Nowadays, an increasingly larger number of map- based applications enable users to ask ...
  • Optimizing dominant pruning algorithm using three hop neighbor information 
    Anannya, Tasmiah Tamzid (Department of Computer Science and Engineering, 2018-02-27)
    Reducing number of forwarding nodes is an important issue to consider when same message needs to be broadcast to all the nodes in a multi-hop ad hoc wireless network. Without proper measures broadcasting may result in many ...
  • Optimum software package for on-line system management and job accounting 
    Kar, Dulal Chandra (Department of Computer Science and Engineering, BUET, 1985-09)
    An access control mechanism is a set of operations performing auth<>- rization and enforcement checks, creation and movement of rights within the system from assigned control functions established by predefined control ...
  • Orthogonal drawings of plane graphs 
    Mahmuda Naznin (Department of Computer Science and Engineering, BUET, 2000-01)
    This thesis deals with orthogonal drawings of plane graphs. Orthogonal drawings have numerous practical applications in different fields of science and technology. In an orthogonal drawing of a plane graph, each vertex ...
  • Overcoming throughput degradation in multi-radio cognitive radio networks 
    Khan, Tanvir Ahmed (Department of Computer Science and Engineering, 2017-07-22)
    In recent years, Cognitive Radio Networks (CRNs) have been widely investigated to solve the well- known spectrum scarcity problem through enhancing spectrum utilization. Another technique of enhancing spectrum ...
  • Overlapping community detection using deep graph neural networks 
    Muttakin, Md Nuru (Department of Computer Science and Engineering, 2022-08-17)
    Artificial intelligence (AI) is comparable to human intelligence in many cases. Especially in the case of graph-structured data, there are many AI algorithms and machine learning models which not only can understand these ...
  • Parallel algorithm for generalized vertex-colorings of partial K-trees 
    Eunus Ali, Mohammed (Department of Computer Science and Engineering, BUET, 2002-10)
    In this thesis we present an efficient parallel algorithm for solving the generalized vertex-coloring (l-vertex-coloring) problem on partial k-trees. Let l be a positive integer, and let G be a graph with nonnegative ...

Search BUET IR


Advanced Search

Browse

My Account