In this paper we consider the edge searching and node searching problems on trees Given a tree we show a transformation from an optimal node search strategy to an optimal edge search strategy Using our transformation we simplify a previous linear time algorithm for determining the edge search number of a tree and improve the running time of a previous algorithm for constructing an optimal edge ...

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using theminimumnumber of successive values of its own s...

in this paper, a new numerical method is presented for solvingthe optimal control problems of bang-bang type with free or xed terminaltime. the method is based on bezier polynomials which are presented inany interval as [t0; tf ]. the problems are reduced to a constrained problemswhich can be solved by using lagrangian method. the constraints ofthese problems are terminal state and conditions....

in this paper a new method is introduced and investigated for removing the destabilizing effects of time-delay parameter in control loops. the concept of the method is taken from the knowledge concerning the dynamic behaviour of irrational transfer functions (ir-tf), which is discussed and investigated elswhere in frequency response domain and is explained briefly here. ir-tfs, which are well c...