Both Konopliv et al. [ 2014] and Lemoine et al. [ 2014] show that the degree strength of their models is at the maximum degree at the poles because of the confluence of tracks.
The Undirected and Directed Eulerian Edge Deletion problems are NP- hard, even when restricted to inputs (G, k) where G is a planar (directed) graph with maximum degree at most 3, and k=| E G)|.
The degree distribution decays very fast terminating at a maximum degree of 17.
In this system, not all jobs will be able to execute at their maximum degree of parallelism.
The trace semantics represents the behaviour of protected assembly code with simple abstractions, unburdened by low-level details, at the maximum degree of precision.
The record hydrogen diffusivity inherent in pure V reduced by alloying with Pd no more than 3 times even at the maximum degree of alloying (13.3%) and lowest temperature (300 °C).
The first approach (setOpt = 1) is to calculate the execution time of job j when it executes at its maximum degree of parallelism on the set of resources R with m resources, while not considering any contention for resources (denoted SET j R ).
Social groups at their maximum degree of instability are expected to respond to the instability via group fission or social overthrow.
In particular, we construct a family of hamiltonian graphs with diameter at most 2⌊log2n⌋, maximum degree 3 and at most 1+11n/8 edges.
Since the constructed instances also have degree at most three, we obtain the NP-hardness of M AXD IC UT with maximum degree three.
In MARS, the maximum number of basis functions was set at 100, and the maximum degree of interaction was set at 2. As MARS does not provide variable significance using p-values, each covariate selected by MARS was used as input into a logistic regression model to determine its significance.
