In parallel with the growth of both domestic and international economies, there have been
substantial efforts in making manufacturing and service industries more environmental …

This thesis shows that whole-program context-sensitive inclusion-based pointer analysis, a
previously intractable problem, can be efficiently solved using binary decision diagrams. In …

We investigate a new class of metrics to find good variable orders for decision diagrams in
symbolic state-space generation. Most of the previous work on static ordering is centered …

Mobile ad hoc networks (MANETs) are gaining popularity in recent years due to their
flexibility, the proliferation of smart computing devices, and developments in wireless …

In this chapter, a scatter search (SS) method is proposed to solve the multiobjective
permutation fuzzy flow shop scheduling problem. The objectives are minimizing the average …

In the last decade job shop scheduling problems have been subject to intensive research
due to their multiple applications. Job shop scheduling is known as a strongly NP-complete …

Ordered Binary Decision Diagrams (OBDDs) have been proven to be an efficient data
structure for symbolic algorithms. The efficiency of the symbolic methods de-pends on the …

Building on recent interest in the analysis of the performance of randomised search
heuristics for permutation problems we investigate the performance of local search when …

Mapping IP cores to an on-chip network is an important step in Network-on-Chip (NoC)
design and affects the performance of NoC systems. A mapping optimisation algorithm and …

Abstract Network-on-chip (NoC) communication architectures present promising solutions
for scalable communication requests in large system-on-chip (SoC) designs. Intellectual …