In the past three decades, deductive games have become interesting from the algorithmic point of view. Deductive games are two players zero sum games of imperfect information. The first player, called ”codemaker”, chooses a secret code and the second player, called ”codebreaker”, tries to break the secret code by making as few guesses as possible, exploiting information that is given by the cod...

We study the reachability problem for hybrid automata. Automatic approaches, which attempt to construct the reachable region by symbolic execution, often do not terminate. In these cases, we require the user to guess the reachable region, and we use a theorem prover (Pvs) to verify the guess. We classify hybrid automata according to the theory in which their reachable region can be deened nitel...

BACKGROUND The intuitive early diagnostic guess could play an important role in reaching a final diagnosis. However, no study to date has attempted to quantify the importance of general practitioners' (GPs) ability to correctly appraise the origin of chest pain within the first minutes of an encounter. METHODS The validation study was nested in a multicentre cohort study with a one year follo...

This paper investigates decoding of binary linear block codes over the binary erasure channel (BEC). Of the current iterative decoding algorithms on this channel, we review the Recovery Algorithm and the Guess Algorithm. We then present a Multi-Guess Algorithm extended from the Guess Algorithm and a new algorithm – the In-place Algorithm. The Multi-Guess Algorithm can push the limit to break th...

In this paper, an efficient and straightforward numerical procedure is constructed to solve multi-dimensional linear nonlinear elliptic partial differential equations (PDEs). Although the for constraint-type fictitious time integration method overcomes stability problem, parameter’s definition, accuracy computational efficiency have not been resolved, lack of initial guess values results in red...

configuration, 138Alternating Register Automata, 25Alternating Tree Register Automata,115ancestor relation ( , ≺), 57ARA, 25ARA(guess, spread), 25ARA(guess, spread, <), 32ATRA, 115ATRA(guess, spread), 115attrXPath, 63Aut, 79Aut , 79