This paper presents a new method for reconfiguration of radial distribution systems for minimisation of real power loss using Adaptive Genetic Algorithm without involving any additional cost for the installation of tap changing transformers, capacitors and concerned switching equipments. The initial population for Genetic Algorithm is created using a heuristic approach and the genetic operators...

This paper discusses optimal control strategies for switching between different burner modes in a novel compact marine boiler design. The ideal behaviour is defined in a performance index the minimisation of which defines an ideal trade-off between deviations in boiler pressure and water level from their respective setpoints and the cost of burner switches and variation of continuous input flow...

The importance of on-chip power-rail inductance in generating delta-I power-supply noise is examined in this paper using systematic circuit simulation of the complete integratedcircuit power net. This source of noise is compared to the resistive IR drop in the net, and to the delta-I noise due to both high-inductanceand low-inductance-bonding packages. Results are presented for a typical on-chi...

Switching activity and schedule length are the two most important factors that influence the energy consumption of an application executed on a VLIW (very long instruction word) processor. Considering these two factors together, we propose an instruction-level energy-minimisation scheduling technique to reduce the energy consumption of applications on VLIW processors. We first formally prove th...

We present a novel state feedback design method for perturbed discrete-time switched linear systems. The method aims at achieving (a) closed-loop stability under arbitrary switching and (b) minimisation of ultimate bounds for specific state components. Objective (a) is achieved by computing state feedback matrices so that the closed-loop A matrices generate a solvable Lie algebra (i.e. admit si...

A general framework for minimisation-based belief change is presented. A problem instance is made up of an undirected graph, where a formula is associated with each vertex. For example, vertices may represent spatial locations, points in time, or some other notion of locality. Information is shared between vertices via a process of minimisation over the graph. We give equivalent semantic and sy...

A general framework for minimisation-based belief change is presented. A problem instance is made up of an undirected graph, where a formula is associated with each vertex. For example, vertices may represent spatial locations, points in time, or some other notion of locality. Information is shared between vertices via a process of minimisation over the graph. We give equivalent semantic and sy...