LAUR Home
→
Browsing by Subject

Browsing by Subject "Genetic algorithms"

Now showing items 1-10 of 10

Exam scheduling algorithms. (c1999)

Mikati, Ziad (Lebanese American University, 2011-05-17)

Scheduling final exams for large numbers of courses and students in liberal arts universities, such as the Lebanese American University (LAU), is an intractable problem. When scheduling is done manually, conflicts and ...
A hybrid heuristic approach to optimize rule based software quality estimation models. (c2008)

Korkmaz, Rita (Lebanese American University, 2011-10-06)

Software quality is defined as the degree to which a software component or system meets specified requirements and specifications. Objectively quantifying software quality is important as it reduces cost, effort and ...
Incremental & classical genetic algorithm. (c2001)

Awad, Mohamad M. (Lebanese American University, 2011-10-13)

A Classical Genetic Algorithm (CGA) is known to find an optimal or near optimal solution for complex and difficult problems. However, there are many cases where these problems are subject to frequent modifications each ...
An incremental approach for test synthesis and scheduling using genetic algorithms. (c2002)

Hajar, Aouni (Lebanese American University, 2011-09-28)
A method for test scheduling using an evolutionary approach. (c2000)

Noujaim, Jad (Lebanese American University, 2011-09-28)

This study presents an evolutionary approach to solve the test-scheduling problem in VLSI circuits. Test Scheduling is an NP-complete problem and, in order to solve it, genetic algorithms are used. The number of cliques ...
A portable message passing distributed library for optimizing combinatorial problems with application to circuits testing. (c2007)

Maamoun, Ahmad (Lebanese American University, 2011-10-21)

Various heuristic algorithms have been used to tackle combinatorial problems such as genetic algorithms and simulated annealing. Recently, MPI has recently emerged as a standard for parallel programmIng on cluster-base ...
Simulated annealing and genetic algorithms for exam scheduling. (c1997)

Tarhini, Abbas A. (2011-04-08)

Scheduling final exams for large numbers of courses and students in Liberal Arts Universities is an intractable problem. If scheduling is done manually by the University Registrar's Office, a huge number of complaints ...
Simulated annealing and improved genetic algorithms for path testing. (c1997)

Joumaa, Rania (Lebanese American University, 2011-04-08)

In this work, we formulate the path testing problem as an optimization problem by combining two previous ideas, and we propose a simulated annealing (SA) algorithm to solve it. We also improve a genetic algorithm (GA) that ...
Simulated tempering and mean field annealing for mapping to multicomputers. (c1996)

Aghazarian, Gabriel I. (Lebanese American University, 2011-04-11)

We worked on two physical optimization algorithms, Mean Field Annealing and Simulated Tempering, to solve the data mapping problem on multicomputers. We studied the effects of user defined parameters on MFA's behavior. ...
Test case generation for path coverage. (c2000)

Salame, Miran (Lebanese American University, 2011-11-16)

Simulated Annealing (SA) and Genetic Algorithms (GA) have been proposed for generating integer-value test cases for path coverage. In this work, we suggest significant improvements to these algorithms and present empirical ...

Now showing items 1-10 of 10

Search LAUR

Advanced Search

Browse

All of LAUR

Browsing by Subject "Genetic algorithms"

LAUR Repository

Browsing by Subject "Genetic algorithms"

Search LAUR

Browse

All of LAUR

My Account