Abstract The computationally hard problem of finite language decomposition is investigated. A L decomposable if there are two languages 1 and 2 such that = . Otherwise, prime. main contribution the paper an adaptive parallel algorithm for finding all decompositions based on exhaustive search incorporates several original methods pruning space. Moreover, since it changes its behavior runtime acq...

Reformulating the history matching problem from a least-square mathematical optimization into Markov Decision Process introduces method in which reinforcement learning can be utilized to solve problem. This provides mechanism where an artificial deep neural network agent interact with reservoir simulator and find multiple different solutions Such formulation allows for solving parallel by launc...