• No results found

Analysis of the optimisation problem

NP completeness of a combinator optimisation problem

NP completeness of a combinator optimisation problem

... We shall consider the set {S,K,I,B,C,S’,B’,C’} of combinators, partly because it is a set in common use, partly since it has known abstraction algorithms associated with it. The results we prove will be appli- cable to ...

28

Analysis and optimisation of SWIPT networks.

Analysis and optimisation of SWIPT networks.

... 6.1 Concluding Remarks In Chapter 3, it has been shown that optimising the receivers’ parameters represented by the PS ratios is equally important to optimising the transmit parameters for an optimum performance of ...

174

Analysis of Reactive Search Optimisation Techniques for the Maximum Clique Problem and Applications

Analysis of Reactive Search Optimisation Techniques for the Maximum Clique Problem and Applications

... The problem does not occur if one selects the node seeding the current clique randomly regardless of their degree and regardless of the fact that they have already been part of a ...

215

'A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem'

'A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem'

... 5.2 Analysis of Results First, let us discuss the results in Table 1. Comparing the computational results on various test instances, one can see that using the random rule alone does not yield a single feasible ...

8

Opinion Analysis through Constraint Optimisation

Opinion Analysis through Constraint Optimisation

... classification problem on the basis of human perfor- ...this problem is the same as we discussed before; as the rating scale increases the adjacent scales are more similar than ...

114

An analysis of indirect optimisation strategies for scheduling.

An analysis of indirect optimisation strategies for scheduling.

... of problem informa- tion in the different greedy procedures, bias was introduced towards some of them, expecting to perform better on random ...the problem, such as the GA used in the present study, the ...

9

Analysis and optimisation of a logistic warehouse in the automotive industry

Analysis and optimisation of a logistic warehouse in the automotive industry

... an analysis of the situation was carried out in order to perceive which aspects required improvement as well as those which, through the implementation of the WMS, would no longer be ...the problem under ...

8

Modelling, analysis and optimisation of ship energy systems

Modelling, analysis and optimisation of ship energy systems

... the optimisation of the WHR system did not include the possibility of operating the propeller at variable speed, which would influence the engine operational point and, therefore, the quantity and quality of the ...

106

Optimisation and Analysis of Riveted Structure with Aluminium Frame

Optimisation and Analysis of Riveted Structure with Aluminium Frame

... Disadvantage of rivets is that they form a permanent connection and can only be removed by destroying rivet. This problem can be overcome by usage of Aluminium profiles which offer a wide variety of uses when ...

7

Runtime analysis of crowding mechanisms for multimodal optimisation

Runtime analysis of crowding mechanisms for multimodal optimisation

... Generalised crowding decreases the fitness of the inferior solution by a scaling factor during selection. We consider the bimodal function T WO M AX and introduce a novel and natural notion for functions with bounded ...

14

NP Completeness of a combinator optimisation problem

NP Completeness of a combinator optimisation problem

... Using the combinators S, K, I, B, C, S', B' and C', together with a rewrite system for a graph representation of combinator expressions such that reduction of a duplicator causes the d[r] ...

35

An integrated approach to a combinatorial optimisation problem

An integrated approach to a combinatorial optimisation problem

... a problem from the healthcare domain, where patients with several chronic conditions follow different guidelines designed for the individual conditions, and where the aim is to find the best treatment plan for a ...

18

Optimisation over the non-dominated set of a multi-objective optimisation problem

Optimisation over the non-dominated set of a multi-objective optimisation problem

... In Chapter 5 the primal method and the dual method are adapted to determine the nadir point of an MOLP. The nadir point is characterized by the componentwise worst values of the non-dominated points of (MOP). The task of ...

96

On the dual of a mixed H2/l1 optimisation problem

On the dual of a mixed H2/l1 optimisation problem

... & Dahleh [2] developed the dual of the MIMO multi-block mixed H 2 /l 1 control problem based on zero interpolation techniques. Nevertheless, for a mixed H 2 /l 1 control prob- lem defined by zero interpolation ...

8

Hybrid Optimisation Method for the Facility Layout Problem

Hybrid Optimisation Method for the Facility Layout Problem

... the problem description, the industry is trying to increase its performance which means solving other facility ...future problem in the industry is to layout a greater number of locations which may reach 30 ...

15

An Ant Colony Optimisation Algorithm for Timetabling Problem

An Ant Colony Optimisation Algorithm for Timetabling Problem

... Timetabling Problem (UCTP) is a combinatorial optimization problem which involves the placement of events into timeslots and assignment of venues to these events while considering the participants: ...

98

Operational analysis & Optimisation

Operational analysis & Optimisation

... Through analysis of operational logs and raw SCADA data we can draw independent conclusions on site performance against the available wind resource in any period, to help client’s understand the performance of the ...

8

Free Search Applied to Large Constraint
Optimisation Problem

Free Search Applied to Large Constraint Optimisation Problem

... Abstract. The article presents experimental results achieved by Free Search on optimisation of 100 dimensional version of so called bump test problem. Free Search is adaptive heuristic algorithm. It ...

9

Meta-heuristic solution approaches to the
portfolio optimisation problem

Meta-heuristic solution approaches to the portfolio optimisation problem

... portfolio optimisation With regard to portfolio selection a number of different ideas considering simulated annealing have been ...portfolio optimisation problem with a VaR model extended with risk ...

100

GPU Performance Analysis and Optimisation

GPU Performance Analysis and Optimisation

... Occupancy Kepler SM resources – 64K 32-bit registers – Up to 48 KB of shared memory – Up to 2048 concurrent threads – Up to 16 concurrent threadblocks.. Occupancy and Performance[r] ...

80

Show all 10000 documents...

Related subjects