Institutional Repository

Browsing by Author "Hossain, Shahadat"

DSpace/Manakin Repository

Browsing by Author "Hossain, Shahadat"

Sort by: Order: Results:

  • Haque, Sardar Anisul; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Deptartment of Mathematics and Computer Science, 2008Arts and ScienceMathematics and Computer Science, 2008)
    The efficiency of linear algebra operations for sparse matrices on modern high performance computing system is often constrained by the available memory bandwidth. We are interested in sparse matrices whose sparsity ...
  • Zulkarnine, Ahmed Tahsin (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2012Arts and ScienceDepartment of Mathematics and Computer Science, 2012)
    One of the main objectives of software development in scientific computing is efficiency. Being focused on highly specialized application domain, important software quality metrics, e.g., usability, extensibility ,etc ...
  • Hasan, Mahmudul (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2011Arts and ScienceDepartment of Mathematics and Computer Science, 2011)
    DSJM is a software toolkit written in portable C++ that enables direct determination of sparse Jacobian matrices whose sparsity pattern is a priori known. Using the seed matrix S 2 Rn×p, the Jacobian A 2 Rm×n can be ...
  • Zibran, Minhaz Fahim; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007Faculty of Arts and ScienceDepartment of Mathematics and Computer Science, 2007)
    Course timetabling is a well known constraint satisfaction optimization (CSOP) problem, which needs to be solved in educational institutions regularly. Unfortunately, this course timetabling problem is known to be ...
  • Bhattacharjee, Sangita; University of Lethbridge. Faculty of Arts and Science (Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, 2010Arts and ScienceDepartment of Mathematics and Computer Science, 2010)
    In this thesis, we study a variant of the maximum cardinality matching problem known as the maximum charge problem. Given a graph with arbitrary positive integer capacities assigned on every vertex and every edge, the ...