Results 1 - 10
of
62,133
Table 1. Traditional Distributed Computing Networks vs. Networks of Embedded Systems
1987
"... In PAGE 2: ... To develop distributed applications for this huge com- puting infrastructure, we need to understand the unique set of characteristics possessed by NES. Table1 presents a comparison between the target networks for traditional dis- tributed computing (e.... ..."
Cited by 1
Table 1. Traditional Distributed Computing Networks vs. Networks of Embedded Systems
"... In PAGE 2: ... To develop distributed applications for this huge com- puting infrastructure, we need to understand the unique set of characteristics possessed by NES. Table1 presents a comparison between the target networks for traditional dis- tributed computing (e.... ..."
Table 6b: Embedded maps ________________________________________________________________________
"... In PAGE 16: ... In this case of linear plane embeddings, the 1-embedding can remain implicit and we only need to embed vertices on points. In Table6 a, point is defined as the type for points in the plane, in fact the Cartesian product of float by itself, with P as a constructor. Thus a point always matches the template P(p1,p2), where p1,p2 are its abscissa and ordinate in a fixed Euclidean coordinate system, origin being the name given to P(0.... In PAGE 16: ... The correspondence between indexes and points is realized thanks a global table, or point environment, of type envp. Table6 a: Management of points ________________________________________________________________________ type point = P of float * float;; let origin = P(0.,0.... In PAGE 16: ... Of course, we are not any more in a pure functional programming. A specification of completely 0-embedded maps is given in Table6 b, with a new constructor I introducing ... In PAGE 17: ... Finally, operation ang q z returns the oriented angle in [0, 2pi[ with the x-axis of the arc 1- embedding z, the arc being considered oriented with z as origin. Preconditions presented in Table6 c constrain these operations. Owing to the choice of point association, embedding has an influence on topology.... In PAGE 17: ... Sewing constraints are detailed and discussed in the general case of hypermaps and general embeddings in [BD94]. Table6 c: Preconditions ________________________________________________________________________ (* prec L(m,k,x,y) = ancient prec amp; amp; (k = 1 implies aig m x = aig m y) prec aig q z = prec ag q z = e q z prec ang q z = e q z amp; amp; a m 0 z /= z amp; amp; ag q O z /= ag q 0 (a q 0 z) *) ________________________________________________________________________ Operations of higher level can be defined to handle and access map cells, i.e.... ..."
Table 2. Constraints in traditional graph drawing.
"... In PAGE 4: ...2 Input Dependent Constraints The constraints in the previous section did not depend on the input. Input dependent constrains that are commonly used in traditional graph drawing [5, 13, 25] are listed in Table2 . Next we discuss the possibility to apply these traditional drawing constraints to the layouts of sequence diagrams.... In PAGE 4: ... Next we discuss the possibility to apply these traditional drawing constraints to the layouts of sequence diagrams. The first constraint in Table2 describes a need to place a given set of vertices to the center of the drawing. This need is justified since the center of a drawing is usually the most important and prominent place where vertices can be placed.... ..."
Table 1. Comparison of traditional LDS and the discrepancy constraint
2002
"... In PAGE 9: ...3.In Table1 ,the performance of this traditional approach is compared with the performance of the discrepancy constraint (referred to as discr cst in Table 1). In this table results on TSPTW instances (taken from [1]) are reported.... In PAGE 9: ...3.InTable1,the performance of this traditional approach is compared with the performance of the discrepancy constraint (referred to as discr cst in Table1 ). In this table results on TSPTW instances (taken from [1]) are reported.... ..."
Cited by 10
Table 1. Comparison of traditional LDS and the discrepancy constraint.
"... In PAGE 9: ...3. In Table1 , the performance of this traditional approach is compared with the performance of the discrepancy constraint (referred to as discr cst in Table 1). In this table results on TSPTW instances are reported.... In PAGE 9: ...3. In Table 1, the performance of this traditional approach is compared with the performance of the discrepancy constraint (referred to as discr cst in Table1 ). In this table results on TSPTW instances are reported.... ..."
Table 2: Measurements with traditional scheduling constraints. 10
1997
"... In PAGE 9: ... In addition to the number of branch-and-bound nodes, the table also lists data the numbers of variables and constraints prior to any simpli cations that might be performed by the CPLEX solver, as well as the number of simplex iterations per- formed by the CPLEX solver, the number of operations, N, and the initiation interval, II. For comparison, we provide the same data for the four algorithms with the traditional formulation of the dependence constraints in Table2 ; however, we only consider the structured formulation in the discussion below. First, observe the distribution of the data in Table 1.... ..."
Cited by 15
Table 48 - Embedded System Types
"... In PAGE 7: ..................................... 49 Table48 - Embedded System Types .... ..."
Table 4. Traditional precision, Constraint 3
2006
Cited by 3
Table 5. Traditional recall, Constraint 3
2006
Cited by 3
Results 1 - 10
of
62,133