### Table 2: Main layout parameters

"... In PAGE 2: ...8 cavi- ties, more efficient in terms of gradient and transit time fac- tor but more expensive to produce. These two options are indicated as (a) and (b) in Table2 , which summarises the main design parameters for the superconducting section. Table 2: Main layout parameters... ..."

### Table II. Features Affecting Algorithm Efficiency on Specific Qubit Technologies (The maximum number of qubits in all technologies remains undetermined with any reliability. Question marks in topologies indicate that the natural area for layout is 2-D, but practical engineering constraints may limit full 2-D layout.) Wiring ops on

2006

Cited by 2

### Table 1. Comparisons of results over ten seeds

1998

"... In PAGE 6: ... The 600,000 value was appropriate for the larger Armour and Buffa problem while the smaller Bazaraa problem converged in much fewer number of solutions searched. Objective function values from the perimeter metric are in Table1 , where the best, median, worst and standard deviation over ten random seeds are shown. The twenty department Armour and Buffa (A amp;B) problem was studied with maximum aspect ratios of 10, 7, 5, 4, 3 and 2, which represent problems ranging from lightly constrained to extremely constrained.... ..."

Cited by 3

### Table 24: CI 6A Values and Description

2007

"... In PAGE 10: ... 57 Table 23: Design option A and B average efficiency. 58 Table24 : CI 6A Values and Description 58 Table 25: Approximate Comparison of the Agenda and Real Session Outline. 61 Table 26: Criteria, CIs, and value level chosen in chronologic order.... ..."

### Table 2. CPU times for solving the optimization layout problem with and without the method. Solved instances are described in [16]

in Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems

1998

"... In PAGE 6: ... backtrack() { crtVar = old_variable(); if(crtVar == nil) no_solution(); remove_value_from_var(crtVal,crtVar); for every V permutable with crtVar do { if(not(instantiated(V))) { if(V belong a non instantiated constrained structure) { remove_value_from_var(crtVal,V); } } } forward(); } The correctness of this method is not reported here, for reasons of space limitations. We tested it on a set of instances of the layout problem [16], results are reported in Table2 . The solution reported here to exploit symmetry can be compared with the method proposed in [16], which requires a radically new design of the problem.... In PAGE 6: ... The solution reported here to exploit symmetry can be compared with the method proposed in [16], which requires a radically new design of the problem. 8 EFFICIENCY Table2 shows results on optimization layout problems solved with the BackTalk system [17, 18]. Table 2.... ..."

Cited by 8

### Table 3 Compression ratio comparison between block C4 and block GC3 for different layers of layout.

"... In PAGE 7: ... To alleviate this problem, we adapt the bucket size for the Golomb run-length coder from layer to layer. As shown in Table3 , block GC3 results in about 10 to 15 % lower compression efficiency than block C4 over dif- ferent process layers of layouts, assuming decoder buffer size of 1.7 kB.... In PAGE 7: ...7 kB. The test images in Table3 are 1024 H110031024 five-bit grayscale rasterized, flattened layouts, ex- amples of which are shown in Figs. 4H20849aH20850 and 4H20849bH20850.... ..."

### Table Layout

1996

### Table 4: Review of classes of graphs optimally solvable in polynomial time. (n denotes the number of nodes in the graph, m the number of edges and d its maximal degree)

2002

"... In PAGE 6: ... Recall that NP-completeness results do not rule out the existence of efficient algorithms to get optimal layouts on particular classes of graphs. Table4 summarizes... ..."

Cited by 11