We develop and evaluate a new exact algorithm for finding Nash equilibria of two-player zero-sum extensive-form games with imperfect information. Our approach is based on the sequenceform representation of the game, and uses an algorithmic framework of double-oracle methods that have been used successfully in other classes of games. The algorithm uses an iterative decomposition, solving restric...

An exact fractional step or projection method for solving the incompressible Navier–Stokes equations is analyzed. The method is applied to both structured and unstructured staggered mesh schemes. There are no splitting errors associated with the method; it satisfies the incompressibility condition to machine precision and reduces the number of unknowns. The exact projection technique is demonst...

We are interested in the graph coloring problem.We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to the linearwidth of the entry graph, but linear according to its number of vertices. We present some experiments performed on literature instances, among which COLOR02 library instances. Our method is useful to solve mo...

Although PM was basically created to treat subjective comparisons, given exact values can be converted to Potential Method flow. A new feature of PM is a parameter called FlowNorm which helps to treat problems where each criterion has its own measurement scale. Complex hierarchial structures and problems modelled by decision tables can be handled. Incomplete data, such as incomplete belief, is ...

We are given a neural spike train with spike times t1, . . . , tn and we want to discover something about the resolution over which these spike times were generated. A heuristic approach is to fix a statistic of the spike train, say f(t1, . . . , tn), and then Monte Carlo jitter each of the spike times by some small random amount, computing the statistic over and over again for each jitter. Pre...

This study investigates an exact method for the Robotic Cell Problem. We present an exact branch and bound algorithm which is the first exact procedure specifically designed for this strongly NP-hard problem. In this paper, we propose a new mathematical formulation and we describe a new lower bound for the RCP. In addition, we propose a genetic algorithm. We report that the branch and bound alg...

in this present work, the kudryashov method and the functional variable method are used to construct exact solutions of the complex kdv equation. the kudryashov method and the functional variable method are powerful methods for obtaining exact solutions of nonlinear evolution equations.

Total electron content measurements by using dual-frequency signals of global navigation satellite systems (GNSS) makes it possible to obtain the distribution density ionosphere with high spatial and temporal resolution. Such resolution allows explore small-scale traveling ionospheric disturbances generated terrestrial geophysical events, including seismic activity, solar terminator passage, at...