LAUR Home
→
Browsing by Subject

Browsing by Subject "Simulated annealing (Mathematics)"

Now showing items 1-8 of 8

Efficient area optimization in high level synthesis using priority-driven simulated annealing. (c2009)

Abi Saad, Maria (2011-10-24)

One of the major enhancements that can be made to the synthesis process is reducing the overall area of a design in order to either decrease the manufacturing costs or introduce more functionality to the design. Optimizing ...
Final exams scheduling for univeristies. (c2001)

Timany, Mazen Nuhad (Lebanese American University, 2011-10-14)

Scheduling final exams for large numbers of courses and students in universities, such as the Lebanese American University (LAU), is an intractable problem. In order to solve this problem, the approach must be efficient, ...
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 ...
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-8 of 8

Search LAUR

Advanced Search

Browse

All of LAUR

Browsing by Subject "Simulated annealing (Mathematics)"

LAUR Repository

Browsing by Subject "Simulated annealing (Mathematics)"

Search LAUR

Browse

All of LAUR

My Account