Motivation for Optimisation Sample Clauses

Motivation for Optimisation. A particularly challenging aspect of a multi-objective analysis of a complex system under design that was briefly mentioned in the preceding section is that of design exploration. Embedded systems are characterised by sharing of information and hardware resources which means that large numbers of configuration and reconfiguration options are available not only at design time but also at run time, due to the use of shared processors and communication channels. When the functions of a system can be delivered by multiple different configurations, designers are faced with hard optimisation problems, especially when the design space is very large (as is typical for complex systems). Approaches to Optimisation. Optimisation problems like the RAP have been addressed by numerous researchers. A review of early work on the RAP can be found in Xxxxx et al (1977) [56] and Xxxx (1992) [57] has shown that the problem is NP-hard. Fyffe et al (1968) [58] used a dynamic programming algorithm to solve RAP in a series of 14 k-out-of-n subsystems and it was also solved using integer programming by Xxxxx and Xxxxxx (1969) [59]. Xxxxxxxx and Xxxxxxxx (1981) [60] used a surrogate constraints approach to solve 33 variations of Xxxxx'x problem which have since become a benchmark for optimisation methods seeking to solve the RAP.