Wolsey (1988),Integer and Combinatorial Optimization, Wiley, New York. Google Scholar S. Olariu (1989), Weak Bipolarizable Graphs,Discrete Mathematics 74, 159–171. Google Scholar S. Onn (1992), On the Combinatorics of Permutation Polytopes,Journal of Combinatorial Theory, Series A. R. E....
Assessing Probability of Correct Ambiguity Resolution in the Presence of Time-Correlated Errors To meet their accuracy requirements, many applications require the resolution of the carrier phase ambiguities to their integer values. However, the proces... KYLE,O'KEEFE,MARK,... - 《Navigation》 被引...
It is shown that the determination of B 2( G) for arbitrary G is NP-complete. Essentially the same proof can be used in showing the NP-completeness of minimizing | f| over all embeddings f: G → Z n of G into the n-dimensional integer lattice for any fixed n ≥ 2....
Returning to the engineering design process of the desired injection-molded components, it is imperative to have accurate simulation tools of the injection-molding process at hand. This process involves filling a cavity with a polymer melt in which the fibers are suspended. Apart from the obviously...
If T is the smallest positive integer such that f(x) divides 1 + xT, then the integer T is called the period of the LFSR. If T = 2n-1, then the n-stage LFSR generating the maximum-length sequence is called a maximum-length LFSR. For example, consider the four-stage standard and ...
3.1. C The C language was designed in 1972, with the purpose of working the same way on different machine types. So, it doesn’t determine directly a range for the integer data type as that depends on machine architecture. However, C has two kinds of integers; short and long. A short...
An expression that evaluates to an object in the Applies To list value A long integer Data Type Long Modifiable Read/write Prototype (C/C++) HRESULT GetMaximumSize(LPLONG pRetVal); HRESULT SetMaximumSize(long NewValue); Applies To:
(i.e., whether an arc belongs to the path). This feature differentiates CMCPIP from some of the existing network interdiction problems, whose formulations contain continuous variables at the user level and assume integer interdictor decisions (e.g., Israeli & Wood, 2002; Wood, 1993). Indeed...
We describe a new simulation technique for the evolution of the maximum cooperative P systems based on integer linear programming. Finally we illustrate the evolution by an example. 展开 关键词: cooperative P systems computational complexity integer linear programming ...
The maximum size of a partial 3-spread in a finite vector space over GF(2) Let n ≥ 3 be an integer, let V_n (2) denote the vector space of dimension n over GF(2), and let c be the least residue of n modulo 3. We prove that the ma......