Our work also bears some resemblance to the literature on cost-sharing mechanisms for network design problems, such as those considered by Feigenbaum, Papadimitriou, and Shenker [14], Jain and Vazirani [24], and Konm̈ann, Leonardi, and Scháfer [29].
Sample text:```On the other hand, there are research works on the design of graph-based routing algorithms [3], [16], [17], [18], [19], [20], [21], [22], [23] to deal with the void problem.```
Sample intent: method
Sample text:```…methods rely on some additional and often heuristic step to generate an initial solution, such as adversarially-trained neural networks [Conneau et al., 2018, Zhang et al., 2017a,b], robust self-learning [Artetxe et al., 2018b] or
5This can be easily verified by noting that the…```
Sample intent: background



Sample text:```Finding optimal paths in dynamic environments has attracted significant attention in the robotics community (See Latombe (1990); LaValle (1999); Lu et al (2015); Jur (2007) and the references therein).```
Sample intent: method



Sample text:```This seems to be the main drawback of the current implementation in comparison to the method of Black Jepson (“refined” in Table 1).```
Sample intent: result



Sample text:```Following the experimental design proposed in Yannakakis and Hallam (2007c) and Yannakakis et al. (2008) for effectively capturing the level of entertainment, the test-bed game under investigation is played in variants.```
Sample intent: background



Sample text:```We consider as unknown true system the half-load model of the flexible transmission system used as a benchmark in a special issue of the European Journal of Control (Landau et al., 1995b).```
Sample intent: background
Sample text:```This seems to be the main drawback of the current implementation in comparison to the method of Black Jepson (“refined” in Table 1).```
Sample intent: result



Sample text:```On the other hand, there are research works on the design of graph-based routing algorithms [3], [16], [17], [18], [19], [20], [21], [22], [23] to deal with the void problem.```
Sample intent: method



Sample text:```Discrepancies analogous to those between our results and those of simulations have, indeed, recently been observed in the case of the binary perceptron [18], the pspin interaction spin glass [19], and in the case of fluctuating manifolds in random media [20], where dynamically frozen phases were observed in regions of parameter space in which static approaches yielded ergodic phases.```
Sample intent: result



Sample text:```Finding optimal paths in dynamic environments has attracted significant attention in the robotics community (See Latombe (1990); LaValle (1999); Lu et al (2015); Jur (2007) and the references therein).```
Sample intent: method



Sample text:```Our heritability result is generally in agreement with the studies of Kien et al. (2008) in Eucalyptus urophylla and Zhao et al. (2014a) in poplar.```
Sample intent: result



Sample text:```This section contains a generalisation of the basic results on multifractal products of stochastic processes developed in Kahane (1985), Kahane (1987) and Mannersalo et al (2002).```
Sample intent: method



Sample text:```NP3L [10] is consistently outperformed by our methods, while for UPnP [8] our NPnLupC outperforms it in the noisy cases.```
Sample intent: background



Sample text:```For seeking the optimal value of Wh of the sub-problems which corresponds to the h-th level, we can solve the problem by the smoothing proximal gradient (SPG) method [6] fortunately.```
Sample intent: background



Sample text:```…methods rely on some additional and often heuristic step to generate an initial solution, such as adversarially-trained neural networks [Conneau et al., 2018, Zhang et al., 2017a,b], robust self-learning [Artetxe et al., 2018b] or
5This can be easily verified by noting that the…```
Sample intent: background



Sample text:```From a strategic viewpoint, layered modular architectures have the competitive advantage, as well as the challenge, in being doubly distributed [57].```
Sample intent: method