This article presents a wp–style calculus for obtaining bounds on the expected runtime of randomized algorithms. Its application includes determining the (possibly infinite) expected termination time of a randomized algorithm ...

The Simplex algorithm is one of the most important algorithms in discrete optimization, and is the most used algorithm for solving linear programs in practice. In the last 50 years, several pivot rules for this algorithm ...

It is possible to prevent risks and report a realistic scenario when considering the internal productivity of each service. For this, management software is used to help the planning team to obtain more assertive results. ...

O objetivo deste estudo foi verificar a viabilidade econômica e o risco associado à terminação de novilhos em confinamento com dieta alto grão em diferentes estados brasileiros e épocas do ano utilizando ferramentas ...

Advanced communication and information technologies enable smart grids to be more intelligent and automated, although many security issues are emerging. Security situational awareness (SSA) has been envisioned as a potential ...

Time-Bounded A* is a real-time, single-agent, deterministic search algorithm that expands states of a graph in the same order as A* does, but that unlike A* interleaves search and action execution. Known to outperform ...

Given the necessity to adopt techniques with the aim of predict the viability of the investment and know the real economic result, alternatives using simulation and joint analysis of various indicators, can provide ...