### Table 1: Optimality with linear utility functions, for 4 agents Issues 12345 HC 0.973 0.991 0.998 0.989 0.986

"... In PAGE 4: ...2 Results Let us first consider the linear utility function (independent issue) case that has been the focus of almost all previous work on multi-issue negotiation. As we can see ( Table1 ), even the simple HC protocol produces essentially optimal results for a wide range of contract space dimensions. This is easy to understand.... ..."

### Table 7 Without essential vectors With essential vectors CIRCUIT S@

2002

"... In PAGE 5: ... When we increase the chain length beyond 3, the actual number of detected transition faults start to differ, as some of the faults detected by this last chain segment may be detected by the first 2 pairs. Table7 presents the results of the weighted transition- graph algorithm with and without the essential vector optimization. In Table 7, column 2 gives the number of stuck-at vectors in the original STRATEGATE test set, followed by the results for our algorithm without use of essential vectors.... In PAGE 5: ... Table 7 presents the results of the weighted transition- graph algorithm with and without the essential vector optimization. In Table7 , column 2 gives the number of stuck-at vectors in the original STRATEGATE test set, followed by the results for our algorithm without use of essential vectors. The final four columns show the results when essential vectors are used.... ..."

Cited by 3

### Table 3 Links for essential nets

"... In PAGE 6: ... A net like this is called an essential net. The links for essential nets are shown in Table3 on the next page, though we follow de Groote (1999) in reversing the arrows of Lamarche (1994). Definition 5 Given an essential net E its positive conclusion is called the out- put of the essential net and the negative conclusions, as well as the negatives premisses of any positive / or \ link, are called its inputs.... ..."

### Table 1 - ANSI Essential Requirements:

2005

"... In PAGE 8: ...list in Table1 ), and requires other contextual compliance with the normative policies12 and administrative procedures13 established by the ANSI Executive Standards Council or its designee. Table 1 - ANSI Essential Requirements: ... ..."

### Table 2: Essentials of receiver operation

2002

Cited by 40

### Table 1. Essential Node Structures

"... In PAGE 7: ... Once the message reaches the destination group, the message is sent to the destination node using the DSDV routing table. 3 Implementation Overview The essential data structures maintained by each node is shown in Table1 . Some of these members (like id,gid,seqNo,leaderSeqNo) are simple data types, while the rest are multi-valued compound data structures.... ..."

### Table 1: Essential GP Components.

"... In PAGE 2: ... In order to apply GP to the problem of classi cation, sev- eral required key components of a GP system need to be de ned. Table1 lists these essential components along with their descriptions. sqrt x + / * x y y Figure 1: A sample tree representation.... In PAGE 2: ....2 as terminals. Functions +, *, /, sqrt Fitness Function Algorithm 1 (see below) Genetic Opera- tors Reproduction, Crossover, Mutation Table 2: Modeling setup for classi cation function discovery by GP. Refer to Table1 for explanations of the various components. Let Lp, Lr be empty lists For each document D in class C Let Lp = Lp union (the set of |C| documents most similar to D) Let Lr = Lr union (the set of |C| documents most similar to D and also not already in Lr) end for Let P = (no.... ..."

### Table 5: Presence of the essential ideas

1997

Cited by 13

### TABLE II ESSENTIAL GP COMPONENTS.

in Ranking function optimization for effective web search by genetic programming: An empirical study

2004

Cited by 10

### TABLE II ESSENTIAL GP COMPONENTS.

in Ranking Function Optimization For Effective Web Search By Genetic Programming: An Empirical Study

2004

Cited by 10