Results 1 - 10
of
54,782
lable System Using Consensus. In: Distribut- ed Algorithms, Lecture Notes in Computer Science 1151, (ed. Babaoglu and Marzullo), Springer-Verlag, 1996. [19] BEA Systems. WebLogic Workshop. http:// www.bea.com/products/weblogic/workshop/ index.shtml. [20] Gray, J.: Queues are Databases. Proceedings 7th High Performance Transaction Process- ing Workshop. Asilomar CA, September 1995.
Table 1. Function set (gates) used in numerical experiments. Some functions are independent on the input (functions 0 and 1), other depend on only one of the input variables (functions 2-5), other functions depend on two input variables (functions 6-15) and the other functions depends on three input variables (functions 16-19). These functions are taken from [12].
"... In PAGE 2: ...2 Figure 1. The symbols used to represent some of the logical gates in Table1 (OR is function 12, AND is function 6, XOR is function 10 and MUX is function 16). In some pictures a small circle may appear on these symbols indicating the negation (inversion) of the respective results.... In PAGE 5: ... In the first experiment we want to compare the computation effort spent by CGP and MEP for solving this problem. Gates 6, 7 and 10 (see Table1 ) are used in this experiment. The parameters of CGP are given in Table 3 and the parameters of MEP are given in Table 4.... In PAGE 7: ... When the relationship between the success rate and the population size is analyzed a population consisting of 20 MEP chromosomes is used. Gates 10 and 16 (see Table1 ) are used in this experiment (as indicated in [12]). Other MEP parameters are given in Table 4.... ..."
Tableau Methods. Kluwer Academic Publishers, 1999. 2. U. Endriss, N. Maudet, F. Sadri, and F. Toni. Protocol Conformance for Logic- based Agents. In Proceedings of the 18th International Joint Conference on Arti- cial Intelligence (IJCAI-2003). Morgan Kaufmann, 2003. 3. M. Fitting. First-order Logic and Automated Theorem Proving. Springer-Verlag, 2nd edition, 1996. 4. P. McBurney and S. Parsons. Desiderata for Inter-agent Protocols. In Proceed- ings of the First International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2002), Bologna, Italy, 2002.
2003
Cited by 3
Tableau Methods. Kluwer Academic Publishers, 1999. 2. U. Endriss, N. Maudet, F. Sadri, and F. Toni. Protocol Conformance for Logic- based Agents. In Proceedings of the 18th International Joint Conference on Arti- cial Intelligence (IJCAI-2003). Morgan Kaufmann, 2003. 3. M. Fitting. First-order Logic and Automated Theorem Proving. Springer-Verlag, 2nd edition, 1996. 4. P. McBurney and S. Parsons. Desiderata for Inter-agent Protocols. In Proceed- ings of the First International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-2002), Bologna, Italy, 2002.
2003
Cited by 3
Table 9. R2s and Adjusted R2s Model Year 2000 Year 2002
"... In PAGE 8: ... Even if confirmed, we need to be cautious about reading too much into our findings. Table9 shows Proceedings of the 41st Hawaii International Conference on System Sciences - 2008... ..."
Table 2: Empirical parameters for the computer-based simulation
"... In PAGE 6: ... In the following peri- ods, each actor can periodically decide whether or not to use EDI, based on the observed stan- dardization decisions and the expected decision behavior of their business partners (applying de- cision calculi (2) and (4)). The parameterization is based on the described empirical results, sum- marized in Table2 . Some of the parameters such Proceedings of the 41st Hawaii International Conference on System Sciences - 2008... ..."
Table 13: Data for ATUM Traces on 128K Caches [6] Norman P. Jouppi, \Improving Direct-Mapped Cache Performance by the Addition of a Small Fully-Associative Cache and Prefetch Bu ers, quot; in Proceedings of the 17th Annual International Symposium on Computer Architecture, Seattle, Washington, pp. 364{373, IEEE Computer Society and ACM SIGARCH, May 28{31, 1990. Computer Architecture News, 18(2), June 1990. [7] S. Przybylski, M. Horowitz, and J. Hennessy, \Performance Tradeo s in Cache Design, quot; in Proceedings of the 15th Annual International Symposium on Computer Architecture, Honolulu, Hawaii, pp. 290{298, IEEE Computer Society and ACM SIGARCH, May 30{ June 2, 1988. Computer Architecture News, 16(2), May 1988. 36
1993
Cited by 1
Table 3, Sectoral Distribution of Computer Support Specialist Positions, 1998, 2008
in Promising Futures: Promising Practices In Information Technology Training For Disadvantaged Adults
"... In PAGE 15: ...Chapple amp; Zook DRAFT: NOT FOR CITATION OR ATTRIBUTION 13 stay. First, the CSS occupation is concentrated in many sectors that are grounded in the US ( Table3 ). For instance, retail stores, educational services, and telephone communications require computer support specialists to perform hands-on repair work, and sectors like local government lack the flexibility to outsource tasks such as network administration.... ..."
Table 1: Tableau expansion rules for ALCHR+ Spring Symposium (AAAI apos;97). AAAI Press, Menlo Park, California, 1997. To appear. [Sat95] U. Sattler. A concept language for engineer- ing applications with part{whole relations. In Proceedings of the International Conference on Description Logics|DL apos;95, pages 119{ 123, Roma, Italy, 1995.
1997
"... In PAGE 3: ...isMadeOf + hasLayer+ ProcessPartitiveAttribute StructuralPartitiveAttribute+ hasSubprocess+ PartitiveAttribute+ Figure 1: A fraction of the Galen role hierarchy node x0, called the root node, with L(x0) = fDg. T is then expanded by repeatedly applying the rules from Table1 until either the root node is marked satis able or none of the rules is applicable. If the root node is marked satis able then the algorithm returns satis able; otherwise it returns unsatis able.... ..."
Cited by 12
Table 1: Tableau expansion rules for ALCHR+ Spring Symposium (AAAI apos;97). AAAI Press, Menlo Park, California, 1997. To appear. [Sat95] U. Sattler. A concept language for engineer- ing applications with part{whole relations. In Proceedings of the International Conference on Description Logics|DL apos;95, pages 119{ 123, Roma, Italy, 1995.
1997
"... In PAGE 3: ...isMadeOf + hasLayer+ ProcessPartitiveAttribute StructuralPartitiveAttribute+ hasSubprocess+ PartitiveAttribute+ Figure 1: A fraction of the Galen role hierarchy node x0, called the root node, with L(x0) = fDg. T is then expanded by repeatedly applying the rules from Table1 until either the root node is marked satis able or none of the rules is applicable. If the root node is marked satis able then the algorithm returns satis able; otherwise it returns unsatis able.... ..."
Cited by 12
Results 1 - 10
of
54,782