Sentence examples for reconciliation problems from inspiring English sources

We discuss search heuristics based on graph properties provided by the cutset constraint, and show the efficiency of the cutset constraint on benchmarks of the literature for pure minimum cutset problems, and on an application to log-based reconciliation problems where the global cutset constraint is mixed with other boolean constraints.

Section "Algo-rithms for the minimum removal reconciliation problems" is dedicated to the algorithmic developments in the case of a known species tree.

In this work, we extend the nonlinear reconciliation problem to include the detection of the biased parameters.

In this scenario, it arises an interesting and challenging problem: how to identify the same person in different social networks, which is known as the network reconciliation problem.

In some cases, additional information in the form of size assays and size-wise chemical assays have been employed to improve the reconciliation problem.

In this paper, we remodel the reconciliation problem by considering the users' heterogeneous relationships and propose a unified framework called UniRank for incorporating the local features and global features together.

The reconciliation problem was solved using a two stage sequential approach in which the objective function is minimized in Matlab and the absorption chiller is simulated in the Engineering Equation Solver (EES).

Recall that the DTL reconciliation problem, even on fully dated species trees, does not guarantee that the optimal reconciliation is time-consistent, whereas the tcDTL reconciliation problem does.

Although the DTL reconciliation problem can be solved in polynomial time, solving the tcDTL reconciliation problem is NP-hard (Ovadia et al., 2011; Tofigh et al., 2011).

In such case, the reconciliation problem is NP-hard [ 5, 6, 16].

Thus, in this work, we focus on the DTL reconciliation problem.