### Table 1.1: Some applications of memetic algorithms in combinatorial optimization.

2004

Cited by 9

### Table 2. Some special families of combinatorial objects together with corre-

in The Formal Theory of Birth-and-Death Processes, Lattice Path Combinatorics, and Continued Fractions

"... In PAGE 23: ... In this section, we simply make explicit the classes of functions involved for three major special processes arising from queueing theory and population growth models. See Table 4 for a summary and refer to Table2 or #5B10,11,12,13,14#5D for the corresponding combinatorial analogues. The point made here is that continued fractions may adequately serveasanentry to the analysis of special processes.... ..."

### Table 1 Combinatorial optimization problems and their geometric equivalents

"... In PAGE 10: ... Similarly, if we color the graph with a minimum number of colors, then this is equivalent with dividing the collection of lines into a minimum number of subcollections such that each subcollection contains no parallel pairs of lines. Table1 gives an overview of problems in graph theory and their geometric equivalent. Since in this paper we focus on parallel line grouping, we propose two combi- natorial algorithms that can be used to partition a graph of parallel pairs into subgraphs which are or which resemble cliques.... ..."

### Table 2. Some special families of combinatorial objects together with corre- sponding weights, moments, and orthogonal polynomials.

in The Formal Theory of Birth-and-Death Processes, Lattice Path Combinatorics, and Continued Fractions

"... In PAGE 22: ... In this section, we simply make explicit the classes of functions involved for three major special processes arising from queueing theory and population growth models. See Table 4 for a summary and refer to Table2 or [10, 11, 12, 13, 14] for the corresponding combinatorial analogues. The point made here is that continued fractions may adequately serve as an entry to the analysis of special processes.... ..."

### Table 2. Some special families of combinatorial objects together with corre- sponding weights, moments, and orthogonal polynomials.

in The Formal Theory of Birth-and-Death Processes, Lattice Path Combinatorics, and Continued Fractions

"... In PAGE 22: ... In this section, we simply make explicit the classes of functions involved for three major special processes arising from queueing theory and population growth models. See Table 4 for a summary and refer to Table2 or [10, 11, 12, 13, 14] for the corresponding combinatorial analogues. The point made here is that continued fractions may adequately serve as an entry to the analysis of special processes.... ..."

### Table 1 contains the running times of algebraic and combinatorial adjacency test on some examples. It shows that the combinatorial test is almost always faster. A partial explanation for that is the following: One can expect the algebraic test to perform better for proving adjacency (exhibit d ? 2 linearly independent rows) and the combinatorial for proving nonadjacency (exhibit one extreme ray violating Proposition 7), but the number of tests executed on nonadjacent pairs is usually much larger.

"... In PAGE 19: ...Table1 . Comparison of Algebraic and Combinatorial Adjacency Tests test problems sizes Algebraic Test Combin.... ..."

### Table 9) and a few other topics that are still relatively fresh in their minds from their education (graph theory, predicate logic etc.).

1999

"... In PAGE 15: ...7 0.9 Table9 : Topics which those graduating in the last four years (junior participants) learned more thoroughly in their formal education as opposed to those graduating 12 or more years ago (expert participants). Rank Topic % Decrease for juniors Junior learning Expert learning 1 Psychology -42% 0.... In PAGE 40: ... A significant point to note in Table 33 is that details of configuration and release management are considered of moderate importance (ranked 15 in Table 32), but have a particularly large number of people who consider them to be very important (the ranking has risen to 8 in Table 33). In Table9 , some topics are higher in the rankings than in Table 32, including requirements gathering, project management and user interfaces: This indicates a widespread acknowledgement that the details are useful. Rank Topic % who believe important 1 Specific Programming Languages 75% 2 Data Structures 60% 3 Software Design and Patterns 58% 4 Giving Presentations to an Audience 57% 5 Technical Writing 53% 6 Software Architecture 53% 7 Requirements Gathering amp; Analysis 53% 8 Configuration and Release Management 48% 9 Analysis and Design Methods 48% 10 Object Oriented Concepts amp; Tech.... ..."

Cited by 2

### Table 9) and a few other topics that are still relatively fresh in their minds from their education (graph theory, predicate logic etc.).

1999

"... In PAGE 15: ...7 0.9 Table9 : Topics which those graduating in the last four years (junior participants) learned more thoroughly in their formal education as opposed to those graduating 12 or more years ago (expert participants). Rank Topic % Decrease for juniors Junior learning Expert learning 1 Psychology -42% 0.... In PAGE 40: ... A significant point to note in Table 33 is that details of configuration and release management are considered of moderate importance (ranked 15 in Table 32), but have a particularly large number of people who consider them to be very important (the ranking has risen to 8 in Table 33). In Table9 , some topics are higher in the rankings than in Table 32, including requirements gathering, project management and user interfaces: This indicates a widespread acknowledgement that the details are useful. Rank Topic % who believe important 1 Specific Programming Languages 75% 2 Data Structures 60% 3 Software Design and Patterns 58% 4 Giving Presentations to an Audience 57% 5 Technical Writing 53% 6 Software Architecture 53% 7 Requirements Gathering amp; Analysis 53% 8 Configuration and Release Management 48% 9 Analysis and Design Methods 48% 10 Object Oriented Concepts amp; Tech.... ..."

Cited by 2

### Table 9--Elasticity estimates from the different models

"... In PAGE 21: ... Because these four models are non-nested rationalizations of the s ame data, some divergence exists in t he elasticity estimates across the four models, with those from t he log-infrequency of purch ase model the most plausible. The last row of Table9 gives the sample me an of the elasticity of postal services demand with respect to the probability of compute r own ership. For the log-infrequency model, this mean elasticity implies that increases in th e p robability computer owners hip bring about reductions in the demand for postal delivery services at the household-level.... ..."

### Table 2. Components of a IS design theory for information infrastructures

in Theorizing about the Design of Information Infrastructures: Design Kernel Theories and Principles

2004

"... In PAGE 10: ... Using the scale and scope of the II as the main classification criterion we can distinguish between three types of vertical IIs: 1) universal service infrastructure, 2) business sector infrastructure, and 3) and corporate information infrastructure. Table2 clarifies four critical II features for each type of infrastructure. Class of Infrastructure Feature Universal Service Infrastructure (Internet) Business sector Infrastructure Corporate Infrastructure Shared (by) Potentially any application, service or user on earth.... ..."

Cited by 4