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:

  • AHP and topsis based approach to solve student-supervisor assignment problem 
    Tasneem, Tamanna (Department of Computer Science and Engineering, 2021-11-20)
    The growing education sector of the current era offers a lot of choices and different paths for the students as well as for the educators. They now have a lot more opportunities to work with someone who has specific skills ...
  • Algorithms for bar 1-visibility representations of graphs 
    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 ...
  • Algorithms for constructing multi-labeled phylogenetic trees from quartets with fewer leaf duplications 
    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 ...
  • Algorithms for r-gathering and r-gather clustering problems 
    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 ...
  • Automatic scoring of Bangla language essay using generalized latent semantic analysis 
    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 ...
  • Continuous optimization with evoluationary and swarm intelligence algorithms 
    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 ...
  • Efficient algorithms for computing optimal meeting points in the obstructed space 
    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 ...
  • Evolutionary algorithm using adaptive fuzzy dominance and reference point for many-objective optimization 
    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 ...
  • 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 ...
  • New local search based ACO algorithm for solving combinatorial optimization problems 
    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 ...
  • Quartet fiduccia-mattheyses revisited for larger phylogenetic studies 
    Mim, Sharmin Akter (Department of Computer Science and Engineering (CSE), 2022-06-15)
    Withtherecentbreakthroughsinsequencingtechnology,phylogenyestimationatalargerscalehas becomeahugeopportunity.Therefore,foraccurateestimationoflargescalephylogeny,substantial endeavourisbeingdevotedinintroducingnewalgorit ...
  • Real time soft shadow generation for arbitrary planar lights 
    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 ...
  • 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 ...
  • Top k alternative itineraries for trip recommendation 
    Mukit Rashid, Syed Md. (Department of Computer Science and Engineering (CSE), 2022-05-28)
    Trip itinerary recommendation finds an ordered sequence of Point-of-Interests (POIs) from a large number of candidate POIs in a city. Users visiting a new city can use such a recommendation system to easily find an itinerary ...

Search BUET IR


Advanced Search

Browse

My Account