.

Browsing SoAS - Theses and Dissertations by Subject "Computer algorithms"

LAUR Repository

Browsing SoAS - Theses and Dissertations by Subject "Computer algorithms"

Sort by: Order: Results:

  • Rouba G. Nasrallah (Lebanese American University, 2015-09-30)
    In this work, we propose a new model to enhance auto-indexing Arabic texts. Our model denotes extracting new relevant words by relating those chosen by the previous classical methods, to new words using data mining rules. ...
  • Taha, Mohamad Kassem (Lebanese American University, 2013-08-22)
    Proctor assignment refers to assigning proctors to exams with the objective of having the appropriate number of proctors assigned to exams, subject to conditions such as minimizing the load of proctoring and preventing any ...
  • Turk, Lana (Lebanese American University, 2011-10-18)
    The technology of PCs has been in progress in a fast rate for many years. Mobile computing is one of the technologies brought into the area of computers. Different problems have arisen from the narrow bandwidth and limited ...
  • Makarem, Norma (Lebanese American University, 2023-05-19)
    Cluster Editing, a known model for correlation clustering, has garnered significant consideration in the parameterized complexity area and has been utilized in a range of practical contexts. In certain situations, the ...
  • Medawar, Mohammad Kamal El (Lebanese American University, 2016-05-06)
    Portfolio optimization is the problem of allocating capital over different assets in order to maximize the return on the investment and/or minimize its risk, which has been a major concern for investors throughout the ...
  • Zeitunlian, Arda (Lebanese American University, 2011-10-11)
    With the advancement of Internet technology, securing information systems from electronic attacks have become a significant concern. With all the preventive methods, malicious users still find new methods that overcome ...
  • Mouawad, Amer E. (Lebanese American University, 2011-11-29)
    Current generation supercomputers have thousands of cores awaiting highly demanding computations and applications. One area that could largely benefit from such processing capabilities is clearly that of exact algorithms ...
  • Assaf, Ali (Lebanese American University, 2022-07-26)
    Clustering is the process of dividing a set of objects into several classes in which each class is composed of similar objects. Traditional centralized clustering algorithms target those objects that are located in the ...
  • Boukhari, Bahia (Lebanese American University, 2019-12-03)
    The immense improvements in the latest internet inventions encouraged the adaptation of technology within the healthcare sector. The healthcare systems storing highly sensitive information can be targeted by attackers ...
  • Bou Ghosn, Steve (Lebanese American University, 2011-11-14)
    In this paper we investigate the use of two different heuristic techniques to the openshop scheduling problem and we make a comparison between them. The open-shop scheduling problem is NP hard and due to that it's very ...
  • El Zeghondy, Jean (Lebanese American University, 2022-05-19)
    In [1], Nour and Zeidan proposed a numerical algorithm to solve optimal control problems involving sweeping processes. In order to apply this algorithm to real life problems, two numerical methods need to be developed: A ...
  • Makhoulian, Raffi H. (Lebanese American University, 2010-12-13)
    This work introduces a new approach to record clustering where a hybrid algorithm is presented that clusters records based upon threshold values and the query patterns made to a particular database. We study the space ...
  • Kabbara, Rashad Karim (Lebanese American University, 2013-11-18)
    Graphical Processing Units (GPUs) have become popular recently due their highly parallel shared-memory architectures. The computational challenge posed by NP-Hard problems makes them potential targets to GPU-based ...
  • Isahakian, Vatche Raffi (Lebanese American University, 2011-09-26)
    At universities where students enjoy flexibility in selecting courses, the Registrar's office aims to generate an appropriate exam schedule for numerous courses and large number of students. An appropriate exam schedule ...
  • Jazzar, Hanaa Salem El- (Lebanese American University, 2012-09-26)
    University course timetabling is an important problem for scheduling courses into predefined periods and rooms over a week with a given set of constraints. This problem is NP-complete and, thus, heuristics are required ...
  • Naamani, Mohamad A. (Lebanese American University, 2011-10-13)
    Response time in an infonnation system can be improved by reducing the number of blocks accessed when retrieving a document set. One approach is to restructure the document base in such a way that similar documents are ...

Search LAUR


Advanced Search

Browse

My Account