### Table 4. Results on the challenging problems

2000

"... In PAGE 7: ... The last experiment concerns the quality of the solution proposed by ZDD SCG with respect to the exact one. Table 3 and Table4 compare the results obtained by our approach with respect to Scherzo [10]. Since ZDD SCG and Scherzo adopt the same algorithm in the implicit part, we only com- pare the solution cost and the time required to solve the cyclic core.... ..."

Cited by 3

### Table 6: terms excluded in Bledsoe challenge problems

1997

"... In PAGE 19: ... We stress that we do obtain proofs of the theorem excluding only the very safe exclusions, but performance is de nitely enhanced with more risky exclusions. In Table6 we list the exclusions... In PAGE 20: ...ata for a run using very safe exclusions only. (The phrase \ex. 1-4, 16 quot; means that terms 1-4 and 16 are excluded terms for that run.) Lines 4 and 5 provide data using other subsets of the terms in Table6 . The column labeled att.... In PAGE 20: ... Here exclusion means that uni cation cannot instantiate a variable with an ex- cluded term. To illustrate this, the goal ?lt(min(e0; e0); min(X; e0)) can be refuted with the exclusion of all terms in Table6 . In obtaining the proof the term min(min(e0; e0); e0) is generated when X in the goal is instantiated to min(e0; e0).... ..."

Cited by 11

### Table 1. Time Comparison In Challenging Problem Instances

### Table 8: Numerical results on DIMACS implementation challenge problems.

"... In PAGE 20: ... Although the other DIMACS implementation challenge problems are sparse SDPs, their aggregate sparsity patterns and/or their extended sparsity patterns become dense, and therefore, they become out of scope of our approach. Table8 compares the three methods for these two problems which have the same sparse aggregate sparsity patterns, and therefore the same extended sparsity patterns. Table 9 presents the termination error measure according to the DIMACS implementation challenge... ..."

### Table 1. Results of various algorithms on the Motif Challenge Problem

2003

"... In PAGE 4: ... This motivated the more powerful algorithms PRO- JECTION (Buhler and Tompa, 2001), MITRA (Eskin and Pevzner, 2002) and MULTIPROFILER (Keich and Pevzner, 2002a), which are able to solve much harder implantation problems. In Table1 , we list the success rate and running time of PatternBranching on the Motif Challenge Problem, versus each of these algorithms. We define success to mean that the algorithm outputs the implanted motif pattern.... ..."

### Table 2. Results for ZDD SCG and Espresso on the challenging problems

2000

"... In PAGE 7: ... Espresso [3] ob- tains a total cost of 5330 with its normal heuristic mode and 5281 with the Espresso strong mode. The second experiment (see Table 1 and Table2 ) com- pares ZDD SCG to Espresso in the heuristic normal and strong modes, not in the Exact or Signature mode. The tables report the cost of the solution, the time CCB4sB5 to compute the cyclic core (summing the implicit and explicit phases), the CPU total time TB4sB5 and the memory required by ZDD SCG, in megabytes.... ..."

Cited by 3

### Table 1: Some challenges and problems associated with UWB systems.

### Table 2. The challenges related to problem management and its neighbour processes

"... In PAGE 8: ... The problem management process of an energy company The Challenges Related to ITIL-based Processes This section presents our findings regarding the challenges of ITIL-based processes. Table2 describes the ITIL process area, the goal for the process area, and challenges that were identified. ... ..."

### Table 7: Numerical results on DIMACS implementation challenge problems. standard conversion completion

2003

"... In PAGE 20: ...2 34 aggregate sparsity patterns are sparse, but the extended sparsity patterns become dense from them. Table7 compares the three methods for these two problems which have the same sparse aggregate sparsity patterns, and therefore the same extended sparsity patterns. Table 7: Numerical results on DIMACS implementation challenge problems.... ..."

Cited by 16

### Table 2. Results of various profile-based algorithms on the Motif Challenge Problem

2003