DSpace Repository

Browsing Dissertation/Theses - Department of Computer Science and Engineering by Subject "Algorithms"

Browsing Dissertation/Theses - Department of Computer Science and Engineering by Subject "Algorithms"

Sort by: Order: Results:

  • Shaheena Sultana (Department of Computer Science and Engineering (CSE), 2011-09)
    A bar visibility representation of a planar graph G is a drawing of G where each vertex is drawn as a horizontal line segment called bars, each edge is drawn as a vertical line segment where the vertical line segment ...
  • Rahman, Md. Mizanur (Department of Computer Science and Engineering, 2017-11-12)
    A central problem in computational and evolutionary biology is the inference of phylogenetic tree from a set of triplets or quartets. Researchers try to construct phylogenetic tree by com¬bining many triplets or quartets ...
  • Ahmed, Shareef (Department of computer Science and Engineering, 2019-03-28)
    Given a set of customers C, a set of proposed facilities F , an opening cost op(f ) of each facility f ∈ F and a cost function cost(c, f ) for each c ∈ C and f ∈ F , the facility location problem asks to find an assignment ...
  • Monjurul Islam, Md. (Department of Computer Science and Engineering (CSE), 2011-03)
    Automated Essay Grading (AEG) is a very important research area in educational assessment. Several AEG systems have been developed using statistical, Bayesian Text Classification Technique, Natural Language Processing ...
  • Shafiul Alam, Mohammad (Department of Computer Science and Engineering (CSE), 2013-09)
    Continuous optimization generally refers to the task of finding values for a set of continuous variables that optimizes a given objective function. The problem of continuous optimization appears frequently in every field ...
  • Hashem, Tahsina (Department of Computer Science and Engineering, 2017-12-03)
    In this thesis, we introduce an Obstructed Optimal M eeting P oint (OOMP) query that enables a group of users to identify a meeting location with the minimum total travel distance in presence of obstacles. For example, a ...
  • Das, Siddhartha Shankar (Department of Computer Science and Engineering, 2017-09-18)
    Many-objective optimization is very important for numerous practical applications. It, how- ever, poses a great challenge to the Pareto dominance based evolutionary algorithms. In this thesis, a fuzzy dominance based ...
  • 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 ...
  • 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 ...
  • Mushfiqur Rouf (Department of Computer Science and Engineering, BUET, 2007-08)
    Shadows are crucial for the human perception of the 3D world. Hard shadows are produced when a typical 011 definition of shadows is applied: if the light source can be seen from a pixel, it is lit; otherwise, it is in ...
  • 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 ...

Search BUET IR


Advanced Search

Browse

My Account