• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 50,684
Next 10 →

Table 6.1 Variants of Algorithm

in A LINE SEARCH MULTIGRID METHOD FOR LARGE-SCALE CONVEX OPTIMIZATION
by Zaiwen Wen, Donald Goldfarb 2007

Table 1. Algorithm variants

in unknown title
by unknown authors
"... In PAGE 2: ... _________________________________________ Figure 2. The BAGA Algorithm Table1 indicates several different variants used in the empirical study. In addition to accuracy, other evaluation function such as Compound Diversity (CD) is also used.... ..."

Table 4: Variants of the Algorithm of Table 4, Part I

in Solving Multi-Mode Resource-Constrained Project Scheduling Problems by a Simple, General and Powerful Sequencing Algorithm. Part II: Computation
by Arno Sprecher, Andreas Drexl
"... In PAGE 15: ... 3.2 Exact Methods The summary of the di erent variants implemented is given in Table4 , where (+) denotes that the related bounding rule is employed and ({) that it is not. The basic variant V0 matches, except for the corrections mentioned in Section 3, Part I, the algorithm proposed in [12] and [13].... ..."

Table 4. The four algorithm variants on the Shekel function (shekel) Algorithm

in Test Results for an Interval Branch and Bound Algorithm for Equality-Constrained Optimization
by R. Baker Kearfott 1996
Cited by 8

Table 4. The four algorithm variants on the Shekel function (shekel) Algorithm

in Test Results for an Interval Branch and Bound Algorithm for Equality-Constrained Optimization
by R. Baker Kearfott 1996
Cited by 8

Table 7 Failure rate of several variants of the translation algorithm for representative thresholds.

in Translating Collocations for Bilingual Lexicons: A Statistical Approach
by Frank Smadja, Vasileios Hatzivassiloglou , Kathleen R. McKeown

Table 7: Variants of TS algorithm - Reserve instances (gap % and iterations).

in Network Synthesis with Non-Simultaneous Multicommodity Flow Requirements: Bounds and Heuristics
by Martine Labbe, René Séguin, Patrick Soriano, Christelle Wynants

Table 1. Some results with gener alize d bise ction and a variant of Algorithm 5.2

in (1.1) æ A Review of Preconditioners for the Interval Gauss–Seidel Method
by R. Baker Kearfott, Chenyi Hu, Manuel Novoa Iii

Table 2: Algorithms for variants of the marked ancestor problem updates query remarks

in Marked Ancestor Problems
by Stephen Alstrup, Thore Husfeldt, Theis Rauhe 1998
"... In PAGE 2: ... Summary. Table2 shows time bounds per operation for a number of variants of the marked ancestor problem sup- porting various sets of update and query operations. In summary, we can provide optimal worst case algo- rithms for mark and exists.... ..."
Cited by 3

Table 2: Algorithms for variants of the marked ancestor problem updates query remarks

in Marked ancestor problems (extended abstract
by Stephen Alstrup 1998
"... In PAGE 2: ... Summary. Table2 shows time bounds per operation for a number of variants of the marked ancestor problem sup- porting various sets of update and query operations. In summary, we can provide optimal worst case algo- rithms for mark and exists.... ..."
Cited by 3
Next 10 →
Results 1 - 10 of 50,684
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University