### Table 1: Some design patterns and natural places in the

1998

"... In PAGE 5: ...replaceKey#28z loc, new Integer#28u dist + e weight#29#29; Code Fragment7:Fragments from the implementation of Dijkstra apos;s algorithm 4 Conclusion In this paper we survey a number of useful object- oriented software design patterns and describe natu- ral places where they can be introduced in the stan- dard curriculum for the Freshman-Sophomore data structures course #28CS2#29. We summarize our sugges- tions in Table1 . We feel that introducing such design principles early in the computer science curriculum helps students form a framework for engineering soft- ware that will complement the theoretical foundation... ..."

Cited by 11

### Table 2. Billing Parameters Description

2001

Cited by 2

### Table 1: Some design patterns and natural places in the CS2 curriculum where they can be introduced.

1998

"... In PAGE 5: ...replaceKey(z loc, new Integer(u dist + e weight)); Code Fragment 7: Fragments from the implementation of Dijkstra apos;s algorithm 4 Conclusion In this paper we survey a number of useful object- oriented software design patterns and describe natu- ral places where they can be introduced in the stan- dard curriculum for the Freshman-Sophomore data structures course (CS2). We summarize our sugges- tions in Table1 . We feel that introducing such design principles early in the computer science curriculum helps students form a framework for engineering soft- ware that will complement the theoretical foundation... ..."

Cited by 11

### Table 1. Complexity of several games.

2003

"... In PAGE 3: ...2 Complexity in the game Abalone It is worthwhile to note the complexity of the task proposed. Table1 compares the branching factor and the state space dimension of some zero-sum games.... ..."

Cited by 1

### Table 1. Deflnition of A and K in natural form for some exponential families.

2003

"... In PAGE 5: ... Often, T (x) is just x. Many familiar distributions, such as the Normal, Bernoulli, Multinomial, Poisson and Gamma distributions can be written in this form ( Table1 ). Note that A and K are related through the Laplace transform K( ) = log Z exp(A(x) + TT (x)) dx since p(xj ) is normalized.... ..."

Cited by 10

### TABLE A1: General Parametersa

2003

Cited by 1

### Table 2. Game theory in negotiation

2001

"... In PAGE 6: ... More complex negotiations may arise when domains have competing or even conflicting objectives. For example, consider the setting illustrated in Table2 . Here we have two are two domains, each of... In PAGE 7: ...We assume that each domain starts with a limited number of routes of each type (see Table2 (c)). The domains are unable to share routes, and can only trade some of their routes with each other in order to increase their profits.... In PAGE 7: ... Game theory [2] provides a mathematical framework for studying situations where individual rational decision makers are working towards competing or conflicting objectives. We can use game theory to find a solution for the problem in Table2... In PAGE 8: ...omain D1). Thus this alternative is not a stable outcome. This observation is intuitively satisfying, since from a security point of view we can see that this alternative solution violates the least privilege principle (defined in the previous example). In light of this second example, let us reexamine our four questions for the general case of any negotiation that can be cast in terms of objective values and resources, as in Table2 . (Note that our previous example (in Table 1) can also be recast in this form.... In PAGE 9: ... Detecting success or failure becomes part of the negotiating strategy, and a decision as to whether to continue negotiating must be made at each step of the negotiation. For example, consider the prob- lem in Table2 , and assume that the contents of Table 2(a) are known only to Domain 1 and the contents of Table 2(b) are known only to Domain 2. This would constitute a negotiation with local constraints.... In PAGE 9: ... Detecting success or failure becomes part of the negotiating strategy, and a decision as to whether to continue negotiating must be made at each step of the negotiation. For example, consider the prob- lem in Table 2, and assume that the contents of Table 2(a) are known only to Domain 1 and the contents of Table2 (b) are known only to Domain 2. This would constitute a negotiation with local constraints.... In PAGE 11: ... Thus the information required to assign a numeric value to any given common state must be specified by the system administrator. This was the case in Table2 , where preferences were quantified as the value associated with each objective. This discussion and attempts to provide answers to our four questions for the case of negotiation with local constraints opens several avenues of further research: a.... ..."

Cited by 9

### Table 2. Game theory in negotiation

2001

"... In PAGE 6: ... More complex negotiations may arise when domains have competing or even conflicting objectives. For example, consider the setting illustrated in Table2 . Here we have two are two domains, each of... In PAGE 7: ...We assume that each domain starts with a limited number of routes of each type (see Table2 (c)). The domains are unable to share routes, and can only trade some of their routes with each other in order to increase their profits.... In PAGE 7: ... Game theory [2] provides a mathematical framework for studying situations where individual rational decision makers are working towards competing or conflicting objectives. We can use game theory to find a solution for the problem in Table2... In PAGE 8: ...omain D1). Thus this alternative is not a stable outcome. This observation is intuitively satisfying, since from a security point of view we can see that this alternative solution violates the least privilege principle (defined in the previous example). In light of this second example, let us reexamine our four questions for the general case of any negotiation that can be cast in terms of objective values and resources, as in Table2 . (Note that our previous example (in Table 1) can also be recast in this form.... In PAGE 9: ... Detecting success or failure becomes part of the negotiating strategy, and a decision as to whether to continue negotiating must be made at each step of the negotiation. For example, consider the prob- lem in Table2 , and assume that the contents of Table 2(a) are known only to Domain 1 and the contents of Table 2(b) are known only to Domain 2. This would constitute a negotiation with local constraints.... In PAGE 9: ... Detecting success or failure becomes part of the negotiating strategy, and a decision as to whether to continue negotiating must be made at each step of the negotiation. For example, consider the prob- lem in Table 2, and assume that the contents of Table 2(a) are known only to Domain 1 and the contents of Table2 (b) are known only to Domain 2. This would constitute a negotiation with local constraints.... In PAGE 11: ... Thus the information required to assign a numeric value to any given common state must be specified by the system administrator. This was the case in Table2 , where preferences were quantified as the value associated with each objective. This discussion and attempts to provide answers to our four questions for the case of negotiation with local constraints opens several avenues of further research: a.... ..."

Cited by 9

### Table 1. Common cheating forms in online games

"... In PAGE 5: ...1 Generic vs. Specific Cheats Table1 summarizes all cheating forms into two di- visions. The generic division includes seven forms of common cheating in online games, which are also generic to all network applications but may appear with different names such as attacks or intrusions in different contexts.... In PAGE 5: ... 3.2 The Non-Atomic Nature of Some Cheats Although each form included in Table1 can be an independent cheat, an actual case of cheating may be complex and involve multiple cheating forms. An ex- ample is the Pogo cheat discussed in [16].... ..."

### Table 1: Di erent aspects of intellectual intelligence, their corresponding AI principles and methodologies, and games

"... In PAGE 2: ... We can then teach, systemati- cally, AI principles and methodologies in areas of AI to children to improve their thinking and problem-solving abilities. Table1 lists some of these thinking strategies and their corresponding AI principles and methodologies. A few examples of thinking puzzles, games, and educa- tional software through which these thinking method- ologies are taught are also included in the table.... In PAGE 3: ... It is still very di cult to design an AI system that can answer such open-ended questions in uncon- strained natural language. 5 Future Research and Challenges Table1 should certainly be expanded to include more thinking strategies that can be taught with AI princi- ples and methods. Although much positive feedback has been obtained from children and parents attend- ing Creative Kids Workshops, large-scale studies and formal evaluations must be implemented to access ef- fectiveness.... ..."