44,261 research outputs found
The Nondeterministic Waiting Time Algorithm: A Review
We present briefly the Nondeterministic Waiting Time algorithm. Our technique
for the simulation of biochemical reaction networks has the ability to mimic
the Gillespie Algorithm for some networks and solutions to ordinary
differential equations for other networks, depending on the rules of the
system, the kinetic rates and numbers of molecules. We provide a full
description of the algorithm as well as specifics on its implementation. Some
results for two well-known models are reported. We have used the algorithm to
explore Fas-mediated apoptosis models in cancerous and HIV-1 infected T cells
A Survey of Monte Carlo Tree Search Methods
Monte Carlo tree search (MCTS) is a recently proposed search method that combines the precision of tree search with the generality of random sampling. It has received considerable interest due to its spectacular success in the difficult problem of computer Go, but has also proved beneficial in a range of other domains. This paper is a survey of the literature to date, intended to provide a snapshot of the state of the art after the first five years of MCTS research. We outline the core algorithm's derivation, impart some structure on the many variations and enhancements that have been proposed, and summarize the results from the key game and nongame domains to which MCTS methods have been applied. A number of open research questions indicate that the field is ripe for future work
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
An efficient method to include equality constraints in branch current distribution system state estimation
Distribution system state estimation is a fundamental tool for the management and control functions envisaged for future distribution grids. The design of accurate and efficient algorithms is essential to provide estimates compliant with the needed accuracy requirements and to allow the real-time operation of the different applications. To achieve such requirements, peculiarities of the distribution systems have to be duly taken into account. Branch current-based estimators are an efficient solution for performing state estimation in radial or weakly meshed networks. In this paper, a simple technique, which exploits the particular formulation of the branch current estimators, is proposed to deal with zero injection and mesh constraints. Tests performed on an unbalanced IEEE 123-bus network show the capability of the proposed method to further improve efficiency performance of branch current estimators
- …