Permalink
Fetching contributors…
Cannot retrieve contributors at this time
11376 lines (11375 sloc) 452 KB
<?xml version="1.0" encoding="UTF-8"?>
<dataset>
<sequence>
<author>Heidegger M.,</author>
<date>1927,</date>
<title>Être et temps,</title>
<editor>Gallimard, Ed.</editor>
<date>1986,</date>
<location>Paris.</location>
</sequence>
<sequence>
<author>Romero, C., Paunesku, D., &amp; Dweck, C.</author>
<date>(2011).</date>
<title>Brainology in the classroom: An online growth mindset intervention a↵ects GPA, conduct, and implicit theories.</title>
<container-title>Poster session presented at Society for Research in Child Development Biennial Meeting,</container-title>
<location>Montreal, Canada.</location>
</sequence>
<sequence>
<author>Solon, G.</author>
<date>(1999).</date>
<title>Chapter 29. Intergenerational mobility in the labor market.</title>
<editor>In O. C. A. and D. Card (Ed.),</editor>
<container-title>Handbook of labor economics</container-title>
<volume>(Vol. 3, Part A,</volume>
<pages>pp. 1761–1800).</pages>
<location>London:</location>
<publisher>Elsevier.</publisher>
<note>Retrieved from</note>
<url>http://www.sciencedirect.com/science/article/pii/S1573446399030102</url>
</sequence>
<sequence>
<citation-number>60.</citation-number>
<title>Differences in cyclic fatigue resistance between ProTaper Next and ProTaper Universal instruments at different levels.</title>
<author>Pérez-Higueras JJ, Arias A, de la Macorra JC, Peters OA.</author>
<date>septembre 2014,</date>
<journal>J Endod,</journal>
<volume>Vol. 9,</volume>
<pages>pp. 1477-81.</pages>
</sequence>
<sequence>
<author>H. Fischer,</author>
<title>Centre Pompidou,</title>
<journal>Deutsche Bauzeitung,</journal>
<volume>No. 134, Part 3,</volume>
<date>2000,</date>
<pages>20-21</pages>
</sequence>
<sequence>
<author>Brischoux, F., Chakraborty, S., Brierley, D.I., and Ungless, M.A.</author>
<date>(2009).</date>
<title>Phasic excitation of dopamine neurons in ventral VTA by noxious stimuli.</title>
<journal>Proc Natl Acad Sci U S A</journal>
<volume>106,</volume>
<pages>4894–4899.</pages>
</sequence>
<sequence>
<citation-number>[13]</citation-number>
<author>S. E. Han, G. Chen,</author>
<journal>Nano Lett.</journal>
<date>2010,</date>
<volume>10,</volume>
<pages>1012.</pages>
</sequence>
<sequence>
<author>Adams, Nicholson B.,</author>
<title>“A Spanish Romanticist Parodies Himself: Los Hijos del Tı́o Tronera,”</title>
<container-title>Proceedings of the Modern Language Association,</container-title>
<volume>45</volume>
<date>(1930),</date>
<pages>pp. 573–77.</pages>
</sequence>
<sequence>
<author>Lee, L. L., W. E. Howard, and R. E. Marsh.</author>
<date>1990.</date>
<title>Acquired strychnine tolerance by pocket gophers.</title>
<container-title>Proceedings of the Vertebrate Pest Conference</container-title>
<volume>14:</volume>
<pages>87-90.</pages>
</sequence>
<sequence>
<author>A. Cau, R. Kuiper, and W.-P. de Roever.</author>
<title>Formalising Dijkstra's development strategy within Stark's formalism.</title>
<editor>In C. B. Jones, R. C. Shaw, and T. Denvir, editors,</editor>
<container-title>Proc. 5th. BCS-FACS Refinement Workshop,</container-title>
<date>1992.</date>
</sequence>
<sequence>
<author>M. Kitsuregawa, H. Tanaka, and T. Moto-oka.</author>
<title>Application of hash to data base machine and its architecture.</title>
<journal>New Generation Computing,</journal>
<volume>1(1),</volume>
<date>1983.</date>
</sequence>
<sequence>
<author>Alexander Vrchoticky.</author>
<title>Modula/R language definition.</title>
<genre>Technical Report TU Wien rr-02-92, version 2.0,</genre>
<publisher>Dept. for Real-Time Systems, Technical University of Vienna,</publisher>
<date>May 1993.</date>
</sequence>
<sequence>
<author>Marc Shapiro and Susan Horwitz.</author>
<title>Fast and accurate flow-insensitive points-to analysis.</title>
<container-title>In Proceedings of the 24th Annual ACM Symposium on Principles of Programming Languages,</container-title>
<date>January 1997.</date>
</sequence>
<sequence>
<author>W. Landi and B. G. Ryder.</author>
<title>Aliasing with and without pointers: A problem taxonomy.</title>
<publisher>Center for Computer Aids for Industrial Productivity</publisher>
<genre>Technical Report CAIP-TR-125,</genre>
<publisher>Rutgers University,</publisher>
<date>September 1990.</date>
</sequence>
<sequence>
<author>W. H. Enright.</author>
<title>Improving the efficiency of matrix operations in the numerical solution of stiff ordinary differential equations.</title>
<journal>ACM Trans. Math. Softw.,</journal>
<volume>4(2),</volume>
<pages>127-136,</pages>
<date>June 1978.</date>
</sequence>
<sequence>
<author>Gmytrasiewicz, P. J., Durfee, E. H., &amp; Wehe, D. K.</author>
<date>(1991a).</date>
<title>A decision theoretic approach to coordinating multiagent interaction.</title>
<container-title>In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence,</container-title>
<pages>pp. 62-68</pages>
<location>Sydney, Australia.</location>
</sequence>
<sequence>
<author>A. Bookstein and S. T. Klein,</author>
<title>Detecting content-bearing words by serial clustering,</title>
<container-title>Proceedings of the Nineteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval,</container-title>
<pages>pp. 319327,</pages>
<date>1995.</date>
</sequence>
<sequence>
<author>U. Dayal, H. Garcia-Molina, M. Hsu, B. Kao, and M.- C. Shan.</author>
<title>Third generation TP monitors: A database challenge.</title>
<container-title>In ACM SIGMOD Conference on Management of Data,</container-title>
<pages>pages 393-397,</pages>
<location>Washington, D. C.,</location>
<date>May 1993.</date>
</sequence>
<sequence>
<author>C. Qiao and R. Melhem,</author>
<title>"Reducing Communication Latency with Path Multiplexing in Optically Interconnected Multiprocessor Systems",</title>
<container-title>Proc. of HPCA-1,</container-title>
<date>1995.</date>
</sequence>
<sequence>
<author>Ramadge, P., &amp; Wonham, W.</author>
<date>(1989).</date>
<title>The Control of Discrete Event Systems.</title>
<container-title>Proceedings of the IEEE,</container-title>
<volume>77 (1),</volume>
<pages>81-98.</pages>
</sequence>
<sequence>
<author>Schaal, S., &amp; Atkeson, C.</author>
<date>(1994).</date>
<title>Robot juggling: An implementation of memory-based learning.</title>
<journal>Control Systems,</journal>
<volume>14,</volume>
<pages>57-71.</pages>
</sequence>
<sequence>
<author>Hinton, G. E., &amp; Nowlan, S. J.</author>
<date>(1987).</date>
<title>How learning can guide evolution.</title>
<journal>Complex Systems,</journal>
<volume>1,</volume>
<pages>495-502.</pages>
</sequence>
<sequence>
<author>Cameron-Jones, R. M., &amp; Quinlan, J. R.</author>
<date>(1994).</date>
<title>Efficient top-down induction of logic programs.</title>
<journal>SIGART Bulletin,</journal>
<volume>5 (1),</volume>
<pages>33-42.</pages>
</sequence>
<sequence>
<author>D. Ourston and R. J. Mooney.</author>
<title>Changing the Rules: A Comprehensive Approach to Theory Refinement.</title>
<container-title>In Proceedings of the Eighth International Conference on Machine Learning,</container-title>
<pages>pages 485-489,</pages>
<date>1991.</date>
</sequence>
<sequence>
<author>E. Styer,</author>
<title>"Improving Fast Mutual Exclusion",</title>
<container-title>Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing,</container-title>
<date>1992,</date>
<pages>pp. 159-168.</pages>
</sequence>
<sequence>
<author>Pearl, J.</author>
<date>(1988).</date>
<title>Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.</title>
<publisher>Morgan Kaufmann.</publisher>
</sequence>
<sequence>
<author>Larry D. Wittie, Gudjun Hermannsson, and Ai Li.</author>
<title>Eager sharing for efficient massive parallelism.</title>
<container-title>In 1992 International Conference on Parallel Processing,</container-title>
<pages>pages 251-255,</pages>
<location>St. Charles, IL,</location>
<date>August 1992.</date>
<pages>11</pages>
</sequence>
<sequence>
<author>Bylander, T.</author>
<date>(1992).</date>
<title>Complexity results for serial decomposability.</title>
<container-title>In Proceedings of National Conference on Artificial Intelligence,</container-title>
<pages>pp. 729-734.</pages>
<location>San Jose, CA.</location>
<publisher>AAAI Press.</publisher>
</sequence>
<sequence>
<editor>A. Elmagarmid, editor.</editor>
<title>Transaction Models for Advanced Database Applications.</title>
<publisher>Morgan-Kaufmann,</publisher>
<date>1992.</date>
</sequence>
<sequence>
<author>T. Fahringer, R. Blasko, and H. Zima.</author>
<title>Automatic performance prediction to support parallelization of Fortran programs for massively parallel systems.</title>
<container-title>In Proceedings of the 1992 ACM International Conference on Supercomputing,</container-title>
<location>Washington, DC,</location>
<date>July 1992.</date>
</sequence>
<sequence>
<author>A. D. Kallis and D. Klappholz,</author>
<title>``Reaching definitions analysis on code containing array references,''</title>
<container-title>Conf. Rec. of the 4th Workshop on Languages and Compilers for Parallel Computing,</container-title>
<date>Aug. 1991.</date>
</sequence>
<sequence>
<author>R. Fletcher.</author>
<title>Practical Methods of Optimization.</title>
<publisher>John Wiley &amp; Sons,</publisher>
<date>1987.</date>
</sequence>
<sequence>
<author>Clark, K. L.,</author>
<title>Negation as Failure,</title>
<editor>in: H. Gallaire and J. Minker (eds.),</editor>
<container-title>Logic and Data Bases,</container-title>
<publisher>Plenum Press,</publisher>
<location>New York,</location>
<date>1978.</date>
</sequence>
<sequence>
<author>Gent, I. P., &amp; Walsh, T.</author>
<date>(1994a).</date>
<title>Easy problems are sometimes hard.</title>
<journal>Artificial Intelligence,</journal>
<volume>70,</volume>
<pages>335-345.</pages>
</sequence>
<sequence>
<author>P. D. Alevizos.</author>
<title>A linear time algorithm for labeling planar projections of polyhedra.</title>
<container-title>IEEE/RSJ IROS '91</container-title>
<location>(Osaka, Japan),</location>
<date>1991.</date>
</sequence>
<sequence>
<author>Ancona, D., and Zucca, E.</author>
<title>An algebraic approach to mixins and modularity.</title>
<container-title>In Proc. Conference on Algebraic and Logic Programming</container-title>
<location>(Berlin,</location>
<date>1996),</date>
</sequence>
<sequence>
<author>P. Yang and J. H. Chern</author>
<title>"Design for Reliability: The Major Challenge for VLSI,"</title>
<container-title>Proceedings of IEEE,</container-title>
<volume>Vol. 81, No. 5,</volume>
<pages>pp. 730-744,</pages>
<date>May 1993.</date>
</sequence>
<sequence>
<author>M. Gupta and P. Banerjee.</author>
<title>Automatic data partitioning on distributed memory multiprocessors.</title>
<container-title>In Proceedings of the 6th Distributed Memory Computing Conference,</container-title>
<location>Portland, OR,</location>
<date>April 1991.</date>
</sequence>
<sequence>
<author>Harry Heffes and David Lucantoni.</author>
<title>A markov modulated characterization of voice and data traffic and related statistical multiplexer performance.</title>
<journal>IEEE J.Select.Areas Commun., SAC-</journal>
<volume>4,</volume>
<pages>856-867,</pages>
<date>September 1986.</date>
</sequence>
<sequence>
<author>C. Ghezzi, D. Mandriolli, and A. Morzenti.</author>
<title>Trio: A logic language for executable specifications of real-time systems.</title>
<journal>Journal of Systems and Software,</journal>
<volume>12(2),</volume>
<pages>107-123,</pages>
<date>May 1990.</date>
</sequence>
<sequence>
<author>Cohen, W. W.</author>
<date>(1992).</date>
<title>Compiling knowledge into an explicit bias.</title>
<container-title>In Proceedings of the Ninth International Conference on Machine Learning.</container-title>
</sequence>
<sequence>
<author>Winston, P. H., Binford, T. O., Katz, B., &amp; Lowry, M.</author>
<date>(1983).</date>
<title>"Learning physical descriptions from functional definitions, examples, and precedents".</title>
<container-title>National Conference on Artificial Intelligence,</container-title>
<pages>433-439.</pages>
</sequence>
<sequence>
<author>Domingos, P.</author>
<date>(1996b).</date>
<title>Using partitioning to speed up specific-to-general rule induction.</title>
<container-title>In Proceedings of the AAAI-96 Workshop on Integrating Multiple Learned Models,</container-title>
<pages>pp. 29-34.</pages>
</sequence>
<sequence>
<author>P. T. Harker and J.-S. Pang.</author>
<title>Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms, and applications.</title>
<journal>Mathematical Programming,</journal>
<volume>48(2),</volume>
<pages>161-220,</pages>
<date>September 1990.</date>
</sequence>
<sequence>
<author>Knopfmacher, A., and Warlimont, R.</author>
<title>Distinct degree factorizations for polynomials over a finite field.</title>
<journal>Trans. Amer. Math. Soc.</journal>
<volume>347,</volume>
<date>(1995),</date>
<pages>2235-2243.</pages>
</sequence>
<sequence>
<author>Feferman, S.,</author>
<title>Transfinite Recursive Progressions of Axiomatic Theories,</title>
<journal>J. Symbolic Logic,</journal>
<volume>27,</volume>
<pages>259-316</pages>
<date>(1962).</date>
</sequence>
<sequence>
<author>K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy.</author>
<title>Memory consistency and event ordering in scalable shared-memory multiprocessors.</title>
<container-title>In Proceedings of the 17th Annual International Symposium on Computer Architecture,</container-title>
<pages>pages 15-26,</pages>
<date>May 1990.</date>
</sequence>
<sequence>
<author>Etzioni, O. and Weld, D.</author>
<date>(1994)</date>
<title>A Softbot-based Interface to the Internet,</title>
<journal>Comm. of th e ACM,</journal>
<volume>37(7),</volume>
<pages>pages 72-76.</pages>
</sequence>
<sequence>
<author>S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, and C. Tseng.</author>
<title>An overview of the fortran d programming system.</title>
<genre>Technical Report CRPC-TR91121,</genre>
<publisher>Dept of computer Science, Rice University,</publisher>
<date>1991.</date>
</sequence>
<sequence>
<author>R. Chandra, S. Devine, B. Verghese, A. Gupta, M. Rosenblum,</author>
<title>Scheduling and Page Migration for Multiprocessor Compute Servers.</title>
<container-title>Proc. 6th Int'l. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI),</container-title>
<location>San Jose, CA,</location>
<pages>pp. 12-24,</pages>
<date>October 1994.</date>
</sequence>
<sequence>
<author>R. S. Zemel, M. C. Mozer, and G. E. Hinton.</author>
<title>TRAFFIC: Recognizing objects using hierarchical reference frame transformations.</title>
<editor>In D. S. Touretzky, editor,</editor>
<container-title>Neural Information Processing Systems,</container-title>
<volume>Vol. 2,</volume>
<pages>pages 266-273.</pages>
<publisher>Morgan Kaufmann,</publisher>
<location>San Mateo, CA,</location>
<date>1990.</date>
</sequence>
<sequence>
<author>Corkill, D. D.</author>
<date>(1979).</date>
<title>Hierarchical planning in a distributed environment.</title>
<container-title>In Proceedings of the Sixth International Joint Conference on Artificial Intelligence,</container-title>
<pages>pp. 168-175</pages>
<location>Tokyo.</location>
</sequence>
<sequence>
<author>D. Callahan, S. Carr, and K. Kennedy.</author>
<title>Improving register allocation for subscripted variables.</title>
<container-title>In Proceedings of the SIGPLAN '90 Conference on Program Language Design and Implementation,</container-title>
<location>White Plains, NY,</location>
<date>June 1990.</date>
</sequence>
<sequence>
<author>Forsyth, C. H.,</author>
<title>Implementation of the Worst-Case Execution Time Analyser</title>
<date>June 1992,</date>
<publisher>York Software Engineering Ltd., University of York:</publisher>
<note>Task 8 Volume E Deliverable on ESTEC contract 9198/90/NL/SF</note>
</sequence>
<sequence>
<author>J. Tromp,</author>
<title>"How to Construct an Atomic Variable",</title>
<container-title>Proceedings of the Third International Workshop on Distributed Algorithms,</container-title>
<collection-title>Lecture Notes in Computer Science</collection-title>
<volume>392,</volume>
<publisher>Springer Verlag,</publisher>
<date>1989,</date>
<pages>pp. 292-302.</pages>
</sequence>
<sequence>
<author>T. E. Anderson, H. M. Levy, B. N. Bershad, and E. D. Lazowska.</author>
<title>"The interaction of architecture and operating system design".</title>
<container-title>In ASPLOS IV,</container-title>
<pages>pages 108-122,</pages>
<date>1991.</date>
</sequence>
<sequence>
<author>F. Jahanian and Al Mok.</author>
<title>Safety analysis of timing properties in real-time systems.</title>
<journal>IEEE Transactions on Software Engineering,</journal>
<volume>12(9),</volume>
<pages>890-904,</pages>
<date>September 1986.</date>
</sequence>
<sequence>
<author>Hughes, G. E., &amp; Cresswell, J. M.</author>
<date>(1968).</date>
<title>An Introduction to Modal Logic.</title>
<publisher>Methuen and Co. Ltd.</publisher>
</sequence>
<sequence>
<author>Ostroff, J. S.,</author>
<title>"Temporal Logic for Real-Time Systems",</title>
<collection-title>Advanced Software Development Series,</collection-title>
<location>England,</location>
<date>1989.</date>
</sequence>
<sequence>
<author>T. Imielinski, S. Viswanathan,</author>
<title>Adaptive Wire less Information Systems,</title>
<container-title>Proc. of SIGDBS Conf.,</container-title>
<location>Tokyo,</location>
<date>October, 1994.</date>
</sequence>
<sequence>
<author>Pagallo, G., &amp; Haussler, D.</author>
<date>(1990).</date>
<title>Boolean feature discovery in empirical learning.</title>
<journal>Machine Learning,</journal>
<volume>5 (1),</volume>
<pages>71-99.</pages>
</sequence>
<sequence>
<author>D. Waltz.</author>
<title>Understanding line-drawings of scenes with shadows.</title>
<journal>Artificial Intelligence,</journal>
<volume>2,</volume>
<pages>79-116,</pages>
<date>1971.</date>
</sequence>
<sequence>
<author>Cheeseman, P., Kanefsky, B., &amp; Taylor, W.</author>
<date>(1991).</date>
<title>Where the really hard problems are.</title>
<container-title>12th International Joint Conference on Artificial Intelligence,</container-title>
<pages>163-169.</pages>
</sequence>
<sequence>
<author>Cleveland, W. S., and C. Loader,</author>
<date>(1994).</date>
<title>Computational Methods for Local Regression.</title>
<genre>Technical Report 11,</genre>
<location>Murray Hill, NJ:</location>
<publisher>AT&amp;T Bell Laboratories, Statistics Department.</publisher>
</sequence>
<sequence>
<author>T. W. Sandholm and V. R. Lesser,</author>
<title>"An Exchange Protocol Without Enforcement",</title>
<container-title>in the Proceedings of 13th International Distributed Artificial Intelligence Workshop,</container-title>
<location>Seattle, WA.,</location>
<date>July 1994.</date>
</sequence>
<sequence>
<author>Mozer, M. C. &amp; Smolensky, P.</author>
<date>(1988).</date>
<title>Skeletonization: A technique for trimming the fat from a network via relevance assessment.</title>
<container-title>Advances in Neural Information Processing Systems</container-title>
<volume>(Vol. 1),</volume>
<pages>(pp. 107-115).</pages>
<location>Denver, CO:</location>
<publisher>Morgan Kaufmann.</publisher>
</sequence>
<sequence>
<author>A. Gupta, I. Mumick, and V. Subrahmanian.</author>
<title>Maintaining views incrementally.</title>
<container-title>In Preceedings of the 1993 ACM SIGMOD International Conference on Management of Data,</container-title>
<pages>pages 157-166,</pages>
<location>Washington, D. C.,</location>
<date>May 1993.</date>
</sequence>
<sequence>
<author>Dietterich, T. G., &amp; Bakiri, G.</author>
<date>(1995).</date>
<title>Solving multiclass learning problems via error-correcting output codes.</title>
<journal>Journal of Artificial Intelligence Research,</journal>
<volume>2,</volume>
<pages>263-286.</pages>
</sequence>
<sequence>
<author>A. P. Witkin.</author>
<title>Scale-space filtering.</title>
<container-title>In Proc. Intl. Joint Conf. Art. Intell.,</container-title>
<pages>pages 1019-1023,</pages>
<date>1983.</date>
</sequence>
<sequence>
<author>Fink, E., &amp; Veloso, M.</author>
<date>(1994).</date>
<title>Formalizing the prodigy planning algorithm.</title>
<genre>CMU CS Tech Report CMU-CS-94-123.</genre>
</sequence>
<sequence>
<author>Langley, P., &amp; Simon, H. A.</author>
<date>(1995).</date>
<title>Applications of machine learning and rule induction.</title>
<journal>Communications of the ACM,</journal>
<volume>38 (11),</volume>
<pages>55-64.</pages>
</sequence>
<sequence>
<author>Kirkpatrick, S., Gelatt, C., &amp; Vecchi, M.</author>
<date>(1983).</date>
<title>Optimization by simulated annealing.</title>
<journal>Science,</journal>
<volume>220 (4598),</volume>
<pages>671-680.</pages>
</sequence>
<sequence>
<author>C. Rosene,</author>
<title>``Incremental dependence analysis,''</title>
<genre>Ph.D. thesis,</genre>
<publisher>Rice University,</publisher>
<date>March 1990.</date>
</sequence>
<sequence>
<author>Michalski, R.</author>
<date>(1983).</date>
<title>A theory and methodology of inductive learning.</title>
<journal>Artificial Intelligence,</journal>
<volume>20,</volume>
<pages>111-161.</pages>
</sequence>
<sequence>
<author>David R. Cheriton, Hendrik A. Goosen, and Philip Machanick.</author>
<title>Restructuring a Parallel Simulation to Improve Cache Behavior in a Shared-Memory Multiprocessor: A First Experience.</title>
<container-title>In International Symposium on Shared Memory Multiprocessing,</container-title>
<pages>pages 109-118,</pages>
<date>April 1991.</date>
</sequence>
<sequence>
<author>Gmytrasiewicz, P. J., &amp; Durfee, E. H.</author>
<date>(1992).</date>
<title>A logic of knowledge and belief for recursive modeling: Preliminary report.</title>
<container-title>In Proceedings of the Tenth National Conference on Artificial Intelligence,</container-title>
<pages>pp. 628-634</pages>
<location>San Jose, California.</location>
</sequence>
<sequence>
<author>Baader, F.</author>
<date>(1991).</date>
<title>Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles.</title>
<container-title>In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI-91)</container-title>
<location>Sydney, Australia.</location>
</sequence>
<sequence>
<author>E. Dantsin and A. Voronkov.</author>
<title>Complexity of query answering in logic databases with complex values.</title>
<editor>In S. Adian and A. Nerode, editors,</editor>
<container-title>Logical Foundations of Computer Science. 4th International Symposium, LFCS'97,</container-title>
<volume>volume 1234,</volume>
<collection-title>of Lecture Notes in Computer Science,</collection-title>
<pages>pages 56-66,</pages>
<location>Yaroslavl, Russia,</location>
<date>July 1997.</date>
</sequence>
<sequence>
<author>M. Peot and D. E. Smith.</author>
<title>Threat-removal strategies for partial-order planning.</title>
<container-title>In Proceedings of the Eleventh National Conference on Artificial Intelligence,</container-title>
<pages>pages 492-499,</pages>
<location>Washington, D. C.,</location>
<date>1993.</date>
</sequence>
<sequence>
<author>Burton, Robert P. and Sutherland, Ivan E.</author>
<title>"Twinkle Box: A Three-dimensional Computer Input Device".</title>
<container-title>in Proceedings of the National Computer Conference</container-title>
<date>(1974)</date>
<pages>pp. 513-520.</pages>
</sequence>
<sequence>
<author>Barry Wilkinson,</author>
<title>Digital System Design</title>
<publisher>Prentice Hall</publisher>
<date>1987.</date>
</sequence>
<sequence>
<author>Andreas Ermedahl and Jan Gustafsson.</author>
<title>Deriving annotations for tight calculation of execution time.</title>
<publisher>Department of Computer Systems, University of Uppsala and Department of Computer Engineering, Malardalen University,</publisher>
<location>Sweden.</location>
<note>Submitted to EuroPar'97,</note>
<date>February 1997.</date>
</sequence>
<sequence>
<author>Horn, B.</author>
<date>(1986).</date>
<title>Robot Vision,</title>
<publisher>MIT Press.</publisher>
</sequence>
<sequence>
<author>J. Dongarra, J. Bunch, C. Moler, and G. Stewart.</author>
<title>LINPACK User's Guide.</title>
<publisher>SIAM Publications,</publisher>
<location>Philadelphia, PA,</location>
<date>1979.</date>
</sequence>
<sequence>
<author>Peter Puschner and Anton Schedl.</author>
<title>A tool for the computation of worst case task execution times.</title>
<container-title>In Proc. of the 5th EUROMICRO Workshop on Real-Time Systems,</container-title>
<date>1993.</date>
</sequence>
<sequence>
<author>Rivest, R. L., &amp; Schapire, R. E.</author>
<date>(1989).</date>
<title>Inference of Finite Automata Using Homing Sequences.</title>
<container-title>In Proceedings of the 21th ACM Symp. on Theory of Computing,</container-title>
<pages>pp. 411-420.</pages>
</sequence>
<sequence>
<author>D. M. Chiarulli, S. P. Levitan, R. G. Melhem, and C. Qiao.</author>
<title>Locality based control algorithms for reconfigurable optical interconnection networks.</title>
<journal>Applied Optics,</journal>
<note>to appear.</note>
</sequence>
<sequence>
<author>W. Sterling, F. Carino and C. Boss,</author>
<title>"Multimedia Databases and Servers,"</title>
<journal>AT&amp;T Technical Journal,</journal>
<volume>Vol. 74, No. 5,</volume>
<date>September / October 1995,</date>
<pages>pp. 54-67.</pages>
</sequence>
<sequence>
<author>Salomons, O.</author>
<date>(1994).</date>
<title>Computer support in the design of mechanical products.</title>
<genre>Ph.D. Thesis,</genre>
<publisher>Universiteit Twente,</publisher>
<location>Netherlands.</location>
</sequence>
<sequence>
<author>S. C. Woo, M. Ohara, E. Torrie, J. P. Singh, and A. Gupta.</author>
<title>The SPLASH-2 Programs: Characterization and Methodological Considerations.</title>
<container-title>In Proceedings of the 22nd International Symposium on Computer Architecture,</container-title>
<pages>pages 24-36,</pages>
<date>June 1995.</date>
</sequence>
<sequence>
<author>J. E. Dennis and R. B. Schnabel.</author>
<title>Numerical Methods for Unconstrained Optimization and Nonlinear Equations.</title>
<collection-title>Prentice-Hall Series in Computational Mathematics.</collection-title>
<publisher>Prentice-Hall, Inc,</publisher>
<location>Englewood Cliffs, New Jersey,</location>
<date>1983.</date>
</sequence>
<sequence>
<author>J. Borenstein and Y. Koren,</author>
<title>"Obstacle avoidance with ultrasonic sensors,"</title>
<journal>IEEE J. Robotics Automation</journal>
<volume>4,</volume>
<pages>pp. 213-218,</pages>
<date>1988.</date>
</sequence>
<sequence>
<author>V. Lifschitz.</author>
<title>On the semantics of STRIPS.</title>
<container-title>In Reasoning about Actions and Plans: Proceedings of the 1986 Workshop,</container-title>
<location>Timberline, OR,</location>
<date>1987.</date>
<note>Reprinted in Readings in Planning, J. Allen, J. Hendler, A. Tate (eds.), Morgan-Kaufmann, 1990, 523-530.</note>
</sequence>
<sequence>
<author>W. Li.</author>
<title>Linearly convergent descent methods for unconstrained minimization of convex quadratic splines.</title>
<genre>Technical Report TR93-3,</genre>
<publisher>Department of Mathematics and Statistics, Old Dominion University,</publisher>
<location>Norfolk, VA 23529,</location>
<date>1993.</date>
<journal>Journal of Optimization Theory and Applications,</journal>
<note>to appear.</note>
</sequence>
<sequence>
<author>Moggi, E.</author>
<title>Computational lambda-calculus and monads.</title>
<container-title>In Proc. Symposium on Logic in Computer Science,</container-title>
<date>1989,</date>
<pages>14-23.</pages>
</sequence>
<sequence>
<author>K. Smith, W. Appelbe, and K. Stirewalt.</author>
<title>Incremental dependence analysis for interactive parallelization.</title>
<container-title>In Proceedings of the 1990 ACM International Conference on Supercomputing,</container-title>
<location>Amsterdam, The Netherlands,</location>
<date>June 1990.</date>
</sequence>
<sequence>
<author>A. S. Acampora and M. J. Karol,</author>
<title>"An Overview of Lightwave Packet Network."</title>
<journal>IEEE Network Mag.</journal>
<volume>3(1),</volume>
<pages>pages 29-41,</pages>
<date>1989.</date>
</sequence>
<sequence>
<author>Blumer, A., Ehrenfeucht, A., Haussler, D., &amp; Warmuth, M.</author>
<date>(1989).</date>
<title>Learnability and the Vapnik-Chervonenkis dimension.</title>
<journal>Journal of the ACM,</journal>
<volume>36 (4),</volume>
<pages>929-965.</pages>
</sequence>
<sequence>
<author>Tim Watson.</author>
<title>A new representation technique for genetic algorithms.</title>
<editor>In Keane et al.</editor>
<volume>[4],</volume>
<pages>pages 233-246.</pages>
</sequence>
<sequence>
<author>Hermenegildo, M. V.,</author>
<title>An Abstract Machine for Restricted AND-parallel Execution of Logic Programs,</title>
<container-title>in Third International Conference on Logic Programming,</container-title>
<publisher>Springer-Verlag,</publisher>
<location>Berlin,</location>
<date>1986.</date>
</sequence>
<sequence>
<author>L. G. Valiant.</author>
<title>A Bridging Model for Parallel Computation.</title>
<journal>Communications of the ACM,</journal>
<volume>33(8),</volume>
<pages>103-111,</pages>
<date>1990.</date>
</sequence>
<sequence>
<author>Ling, C. X.</author>
<date>(1995).</date>
<genre>Personal communication.</genre>
</sequence>
<sequence>
<author>Albert R. Meyer and Mitchell Wand.</author>
<title>Continuation semantics in typed lambda calculi (summary).</title>
<editor>In Rohit Parikh, editor,</editor>
<container-title>Logics of Programs,</container-title>
<volume>volume 193,</volume>
<collection-title>of Lecture Notes in Computer Science,</collection-title>
<pages>pages 219-224.</pages>
<publisher>Springer-Verlag,</publisher>
<date>1985.</date>
</sequence>
<sequence>
<author>S. E. Conry, K. Kuwabara, V. R. Lesser and R. A. Meyer.</author>
<date>(1991)</date>
<title>Multistage Negotiation for Distributed Satisfaction,</title>
<journal>IEEE Transactions on Systems, Man, and Cybernetics,</journal>
<note>Special Issue on Distributed Artificial Intelligence,</note>
<volume>21(6),</volume>
<pages>1462-1477</pages>
</sequence>
<sequence>
<author>Chernoff, H.</author>
<date>(1952).</date>
<title>A measure of the asymptotic efficiency for tests of a hypothesis based on the sum of observations.</title>
<journal>Annals of Mathematical Statistics,</journal>
<volume>23,</volume>
<pages>493-509.</pages>
</sequence>
<sequence>
<author>Flajolet, P., Gourdon, X., and Panario, D.</author>
<title>Random polynomials and polynomial factorization.</title>
<container-title>In Automata, Languages, and Programming</container-title>
<date>(1996),</date>
<editor>F. Meyer auf der Heide and B. Monien, Eds.,</editor>
<volume>vol. 1099,</volume>
<collection-title>of Lecture Notes in Computer Science,</collection-title>
<publisher>Springer-Verlag,</publisher>
<pages>pp. 232-243.</pages>
<container-title>Proceedings of the 23rd ICALP Conference,</container-title>
<location>Paderborn,</location>
<date>July 1996.</date>
</sequence>
<sequence>
<author>Lars Ole Andersen.</author>
<title>Program Analysis and Specialization for the C Programming Language.</title>
<genre>PhD thesis,</genre>
<publisher>DIKU, University of Copenhagen,</publisher>
<date>May 1994.</date>
</sequence>
<sequence>
<author>L. G. Votta and M. L. Zajac.</author>
<title>Design process improvement case study using process waiver data.</title>
<container-title>In Proceedings of the Fifth European Conference in Software Engineering,</container-title>
<volume>volume 989</volume>
<collection-title>of Lecture Notes in Computer Science,</collection-title>
<pages>pages 44-58.</pages>
<publisher>Springer-Verlag,</publisher>
<date>September 1995.</date>
</sequence>
<sequence>
<author>J. B. Kam and J. D. Ullman,</author>
<title>``Monotone data flow analysis frameworks,''</title>
<journal>Acta Informatica,</journal>
<volume>vol. 7, no. 3,</volume>
<pages>pp. 305-317,</pages>
<date>Jul. 1977.</date>
</sequence>
<sequence>
<author>Cooper, G. F.</author>
<date>(1990).</date>
<title>The computational complexity of probabilistic inference using Bayesian belief networks.</title>
<journal>Artificial Intelligence,</journal>
<volume>42(2-3),</volume>
<pages>393-405.</pages>
</sequence>
<sequence>
<author>C. Pedregal-Martin and K. Ramamritham.</author>
<title>Delegation: Efficiently Rewriting History.</title>
<genre>TR95-90</genre>
<publisher>Computer Science Dept., University of Massachusetts,</publisher>
<location>Amherst,</location>
<date>October 1995.</date>
</sequence>
<sequence>
<author>W. Cohen.</author>
<title>Learning from textbook knowledge: A case study.</title>
<container-title>In AAAI-90,</container-title>
<date>1990.</date>
</sequence>
<sequence>
<author>M. Reiman, and B. Simon.</author>
<title>An Interpolation Approximation for Queueing Systems with Poisson Input.</title>
<journal>Operations Research</journal>
<volume>36, 3</volume>
<date>(1988),</date>
<pages>454-469.</pages>
</sequence>
<sequence>
<author>M. Herlihy and J. Wing,</author>
<title>"Axioms for Concurrent Objects",</title>
<container-title>Proceedings of the 14th ACM Symposium on Principles of Programming Languages,</container-title>
<pages>pp. 13-26,</pages>
<date>1987.</date>
</sequence>
<sequence>
<author>Linden, A., &amp; Weber, F.</author>
<date>(1993).</date>
<title>Implementing inner drive by competence reflection.</title>
<editor>In Roitblat, H. (Ed.),</editor>
<container-title>Proceedings of the 2nd International Conference on Simulation of Adaptive Behavior.</container-title>
<publisher>MIT Press,</publisher>
<location>Cambridge, MA.</location>
</sequence>
<sequence>
<author>Holte, R. C., Acker, L. E., &amp; Porter, B. W.</author>
<date>(1989).</date>
<title>Concept learning and the problem of small disjuncts.</title>
<container-title>In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence,</container-title>
<pages>pp. 813-818</pages>
<location>Detroit.</location>
<publisher>Morgan Kaufmann.</publisher>
<pages>415</pages>
</sequence>
<sequence>
<author>I. Meilijson and U. Yechiali,</author>
<title>"On optimal right-of-way policies at a single-server station when insertion of idles times is permitted,"</title>
<journal>Stoch. Proc. and their Appl.</journal>
<volume>6,</volume>
<pages>25-32,</pages>
<date>1977.</date>
</sequence>
<sequence>
<author>Hopcroft, J., &amp; Ullman, J.</author>
<date>(1979).</date>
<title>Introduction to Automata Theory, Languages, and Computation.</title>
<publisher>Addison-Wesley.</publisher>
</sequence>
<sequence>
<author>S. Aditya, C. Flood, and J. Hicks.</author>
<title>Garbage collection for strongly-typed languages using run-time type reconstruction.</title>
<container-title>In Proceedings of the 1994 ACM Conference on Lisp and Functional Programming,</container-title>
<pages>pages 12-23,</pages>
<location>Orlando, FL,</location>
<date>June 1994.</date>
</sequence>
<sequence>
<author>Arthur M. Keller and Julie Basu.</author>
<title>A predicate-based caching scheme for client-server database architectures.</title>
<container-title>In Proceedings of PDIS-94,</container-title>
<date>1994.</date>
</sequence>
<sequence>
<author>P. T. Zellweger.</author>
<title>Interactions between high-level debugging and optimised code.</title>
<genre>PhD thesis,</genre>
<publisher>Computer Science Division, University of California,</publisher>
<location>Berkeley,</location>
<date>1984.</date>
<note>Published as Xerox PARC Technical Report CSL-84-5.</note>
</sequence>
<sequence>
<author>Oliker, S., Furst, M., &amp; Maimon, O.</author>
<date>(1992).</date>
<title>A distributed genetic algorithm for neural network design and training.</title>
<journal>Complex Systems,</journal>
<volume>6,</volume>
<pages>459-477.</pages>
</sequence>
<sequence>
<author>B. K. P. Horn.</author>
<title>Robot Vision.</title>
<publisher>MIT Press,</publisher>
<location>Cambridge, MA,</location>
<date>1986.</date>
</sequence>
<sequence>
<author>M. J. Feeley and H. M. Levy.</author>
<title>Distributed shared memory with versioned objects.</title>
<container-title>In OOPSLA '92 Conference Proceedings,</container-title>
<pages>pages 247-262,</pages>
<date>October 1992.</date>
</sequence>
<sequence>
<author>Gardenfors, Peter</author>
<date>(1988).</date>
<title>Knowledge in Flux.</title>
<publisher>The MIT Press,</publisher>
<location>Cambridge, MA.</location>
</sequence>
<sequence>
<author>De Raedt, L., &amp; Bruynooghe, M.</author>
<date>(1990).</date>
<title>Indirect relevance and bias in inductive concept learning.</title>
<journal>Knowledge Acquisition,</journal>
<volume>2,</volume>
<pages>365-390.</pages>
</sequence>
<sequence>
<author>Reilly, W. S.</author>
<date>(1996).</date>
<title>Believable Emotional and Social Agents.</title>
<genre>Ph.D. thesis,</genre>
<publisher>School of Computer Science, Carnegie Mellon University.</publisher>
</sequence>
<sequence>
<author>Arun Garg.</author>
<title>Parallel STREAMS: A multi-processor implementation.</title>
<container-title>In Proceedings of the Winter 1990 USENIX Conference,</container-title>
<pages>pages 163-176,</pages>
<location>Washington, D. C.,</location>
<date>January 1990.</date>
</sequence>
<sequence>
<author>J. C. Butcher.</author>
<title>Diagonally implicit general linear methods for ordinary differential equations.</title>
<genre>Technical report,</genre>
<publisher>University of Auckland,</publisher>
<date>1993.</date>
<note>Submitted for publication.</note>
</sequence>
<sequence>
<author>Bederson, B. B., &amp; Hollan, J. D.,</author>
<title>Pad++: A zooming graphical interface for exploring alternate interface physics,</title>
<container-title>Proceedings of User Interface Software and Technology (UIST 94) 1726, ACM,</container-title>
<location>New York,</location>
<date>1994.</date>
</sequence>
<sequence>
<author>Gmytrasiewicz, P. J., Durfee, E. H., &amp; Wehe, D. K.</author>
<date>(1991b).</date>
<title>The utility of communication in coordinating intelligent agents.</title>
<container-title>In Proceedings of the Ninth National Conference on Artificial Intelligence,</container-title>
<pages>pp. 166-172.</pages>
</sequence>
<sequence>
<author>A. Gupta, V Harinarayan, D. Quass.</author>
<title>"Aggregate-Query Processing in Data Warehousing Environments",</title>
<container-title>Proceedings of the 21st VLDB Conference,</container-title>
<location>Zurich, Swizerland,</location>
<date>1995.</date>
</sequence>
<sequence>
<author>Ling Tony Chen, R. Drach, M. Keating, S . Louis, Doron Rotem, Arie Shoshani,</author>
<title>Efficient organization and access of multidimensional datasets on tertiary storage systems,</title>
<journal>Information Systems</journal>
<volume>20(2),</volume>
<pages>pp. 155-183</pages>
<date>(1995).</date>
</sequence>
<sequence>
<author>Deransart, P., Jourdan, M., and Lorho, B.,</author>
<title>Attribute Grammars: Definitions, Systems and Bibliography,</title>
<container-title>Lecture Notes in Computer Science,</container-title>
<volume>Vol. 323,</volume>
<publisher>Springer-Verlag,</publisher>
<location>New York, NY</location>
<date>(1988).</date>
</sequence>
<sequence>
<author>E. Mohr, D. A. Kranz, and R. H. Halstead.</author>
<title>Lazy Task Creation: a Technique for Increasing the Granularity of Parallel Programs.</title>
<container-title>In Proceedings of the 1990 ACM Conference on LISP and Functional Programming,</container-title>
<pages>pages 185-197,</pages>
<date>June 1990.</date>
</sequence>
<sequence>
<editor>Richter (Eds.),</editor>
<title>Topics in Case-Based Reasoning.</title>
<location>Berlin:</location>
<publisher>Springer-Verlag,</publisher>
<pages>pp. 167-181.</pages>
</sequence>
<sequence>
<author>Scott, D., and de Souza, C. S.</author>
<date>1990.</date>
<title>Getting the message across in RST-based text generation.</title>
<editor>In Dale, R.; Mellish, C.; and Zock, M., eds.,</editor>
<container-title>Current Research in Natural Language Generation.</container-title>
<location>New York:</location>
<publisher>Academic Press.</publisher>
<pages>47-73.</pages>
</sequence>
<sequence>
<author>Poole, David</author>
<date>(1988).</date>
<title>A logical framework for default reasoning.</title>
<journal>Artificial Intelligence,</journal>
<volume>36(1),</volume>
<pages>27-47</pages>
</sequence>
<sequence>
<author>S. J. Eggers, D. R. Keppel, E. J. Koldinger, and H. M. Levy.</author>
<title>Techniques for efficient inline tracing on a shared-memory multiprocessor.</title>
<container-title>In Proceedings of the International Conference on Measurement and Modeling of Computer Systems,</container-title>
<pages>pages 37-47,</pages>
<date>May 1990.</date>
</sequence>
<sequence>
<author>S. Abiteboul and V. Vianu.</author>
<title>Datalog extensions for database queries and updates.</title>
<journal>Journal of Computer and System Sciences,</journal>
<volume>43,</volume>
<pages>62-124,</pages>
<date>1991.</date>
</sequence>
<sequence>
<author>R. Lipsett, C. Schaefer, C. Ussery,</author>
<title>VHDL: Hardware Description and Design,</title>
<publisher>Kluwer Academic Publishers,</publisher>
<date>1989.</date>
</sequence>
<sequence>
<author>S. Majumdar, D. Eager, and R. Bunt.</author>
<title>Scheduling in Multiprogrammed Parallel Systems.</title>
<container-title>Proc. of the ACM SIGMETRICS Conf. on Measurement &amp; Modeling of Computer Systems</container-title>
<volume>16, 1,</volume>
<date>(May 1988),</date>
<pages>104-113.</pages>
</sequence>
<sequence>
<author>S. Carr, K. S. McKinley, and C.-W. Tseng.</author>
<title>Compiler optimizations for improving data locality.</title>
<container-title>In Proceedings of the Sixth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VI),</container-title>
<location>San Jose, CA,</location>
<date>October 1994.</date>
</sequence>
<sequence>
<author>Fikes, R. E., &amp; Nilsson, N. J.</author>
<date>(1971).</date>
<title>STRIPS: A new approach to the application of theorem proving to problem solving.</title>
<journal>Artificial Intelligence,</journal>
<volume>2,</volume>
<pages>189-208.</pages>
<note>Also in (Allen et al., 1990). Planning for Contingencies: A Decision-based Approach</note>
</sequence>
<sequence>
<author>Felleisen, M.</author>
<title>Programming languages and lambda calculi.</title>
<url>URL: www.cs.rice.edu/~matthias/411web/mono.ps.</url>
</sequence>
<sequence>
<author>M. Herlihy and J. Wing,</author>
<title>"Linearizability: A Correctness Condition for Concurrent Objects",</title>
<journal>ACM Transactions on Programming Languages and Systems,</journal>
<volume>Vol. 12, No. 3,</volume>
<date>1990,</date>
<pages>pp. 463-492.</pages>
</sequence>
<sequence>
<author>M. J. Wolfe and U. Banerjee.</author>
<title>Data dependence and its application to parallel processing.</title>
<journal>International Journal of Parallel Programming,</journal>
<volume>16(2),</volume>
<pages>137-178,</pages>
<date>April 1987.</date>
</sequence>
<sequence>
<author>Raab, F. H.,</author>
<title>"Remote object position locator".</title>
<genre>US patent 4 0054 881</genre>
<date>October 18, 1977.</date>
</sequence>
<sequence>
<author>Jinxin Lin and Alberto O. Mendelzon.</author>
<title>Merging databases under constraints.</title>
<genre>Manuscript,</genre>
<date>1995.</date>
</sequence>
<sequence>
<author>R. T. Snodgrass.</author>
<title>The Temporal Query Language TQuel.</title>
<journal>ACM TODS,</journal>
<volume>12(2),</volume>
<pages>247-298,</pages>
<date>June 1987.</date>
</sequence>
<sequence>
<author>Vander Linden, K.; Cumming, S.; and Martin, J.</author>
<date>1992.</date>
<title>Expressing local rhetorical relations in instructional text.</title>
<genre>Technical Report 92-43,</genre>
<publisher>University of Colorado.</publisher>
<note>To appear in Computational Linguistics.</note>
</sequence>
<sequence>
<author>Witten, I. H., Neal R. M., and Cleary J. G.</author>
<date>(1987).</date>
<title>Arithmetic coding for data compression.</title>
<journal>Communications of the ACM</journal>
<volume>30,</volume>
<pages>520-540.</pages>
</sequence>
<sequence>
<author>Emihovich, C., &amp; Miller, G. E.</author>
<date>(1988).</date>
<title>Talking to the turtle: A discourse analysis of Logo instruction.</title>
<journal>Discourse Processes,</journal>
<volume>11,</volume>
<pages>183-201.</pages>
</sequence>
<sequence>
<author>R. Harper and G. Morrisett.</author>
<title>Compiling polymorphism using intensional type analysis.</title>
<container-title>In Conference Record of the 22nd Annual ACM Symposium on Principles of Programming Languages,</container-title>
<location>San Francisco, CA,</location>
<date>Jan. 1995.</date>
</sequence>
<sequence>
<author>A. Romanow and S. Floyd.</author>
<title>The Dynamics of TCP Traffic over ATM Networks.</title>
<journal>IEEE Journal on Selected Areas in Communication,</journal>
<volume>13(4),</volume>
<date>May 1995.</date>
</sequence>
<sequence>
<author>Knopfmacher, A.</author>
<title>On the number of distinct degree sizes of a polynomial over a finite field.</title>
<edition>Preprint,</edition>
<date>1996.</date>
</sequence>
<sequence>
<author>S. Amarasinghe and M. Lam.</author>
<title>Communication optimization and code generation for distributed memory machines.</title>
<container-title>In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation,</container-title>
<location>Albuquerque, NM,</location>
<date>June 1993.</date>
</sequence>
<sequence>
<author>C. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel.</author>
<title>Tread-Marks: Shared memory computing on networks of workstations.</title>
<journal>IEEE Computer,</journal>
<volume>29(2),</volume>
<pages>18-28,</pages>
<date>February 1996.</date>
</sequence>
<sequence>
<author>Srinivasan, A., Muggleton, S. H., Sternberg, M. J. E., &amp; King, R. D.</author>
<date>(1996).</date>
<title>Theories for mutagenicity: a study in first-order and feature-based induction.</title>
<journal>Artificial Intelligence,</journal>
<volume>84,</volume>
<pages>277-299.</pages>
</sequence>
<sequence>
<author>B. Berthomieu and M. Diaz.</author>
<title>Modeling and verification of time dependent systems using time Petri nets.</title>
<journal>IEEE Trans. Softw. Eng.,</journal>
<volume>17</volume>
<pages>259-273,</pages>
<date>1991.</date>
</sequence>
<sequence>
<author>A. Agarwal, B.-H. Lim, D. Kranz, and J. Kubiatowicz.</author>
<title>APRIL: a processor architecture for multiprocessing.</title>
<container-title>In Proceedings of the 17th Annual International Symposium on Computer Architecture,</container-title>
<pages>pages 104-114,</pages>
<date>May 1990.</date>
</sequence>
<sequence>
<author>Serra, J.</author>
<date>(1982).</date>
<title>Image Analysis and Mathematical Morphology.</title>
<publisher>Academic Press,</publisher>
<location>London.</location>
</sequence>
<sequence>
<editor>D. Borman, Editor,</editor>
<title>``Telnet Encryption Option,''</title>
<genre>Internet-Draft,</genre>
<publisher>Internet Engineering Task Force, Telnet Working Group</publisher>
<date>(July 1991).</date>
</sequence>
<sequence>
<author>Catlett, J.</author>
<date>(1991b).</date>
<title>Megainduction: Machine Learning on Very Large Databases.</title>
<genre>Ph.D. thesis,</genre>
<publisher>Basser Department of Computer Science, University of Sydney.</publisher>
</sequence>
<sequence>
<author>Quinlan, J. R.</author>
<date>(1990).</date>
<title>Learning logical definitions from relations.</title>
<journal>Machine Learning,</journal>
<volume>5,</volume>
<pages>239-266.</pages>
</sequence>
<sequence>
<author>Felleisen, M.</author>
<title>The theory and practice of first-class prompts.</title>
<container-title>Proceedings of the 15th Annual Symposium on Principles of Programming Languages</container-title>
<date>(1988),</date>
<pages>180-190.</pages>
</sequence>
<sequence>
<author>Narayana, K. T. and Aaby, A. A.,</author>
<title>"Specification of Real-Time Systems in Real-Time Temporal Interval Logic",</title>
<container-title>Proceedings of Real-Time Systems Symposium,</container-title>
<date>December 1988.</date>
</sequence>
<sequence>
<author>Adorni, G., Broggi, A., Conte, G., &amp; D'Andrea, V.</author>
<date>(1993).</date>
<title>A self-tuning system for real-time Optical Flow detection.</title>
<container-title>In Proceedings IEEE System, Man, and Cybernetics Conf,</container-title>
<volume>Vol. 3,</volume>
<pages>pp. 7-12.</pages>
</sequence>
<sequence>
<author>Ripley, B.</author>
<date>(1992).</date>
<title>Statistical aspects of neural networks.</title>
<container-title>Invited lectures for SemStat (Seminaire Europeen de Statistique,</container-title>
<location>Sandbjerg, Denmark,</location>
<date>25-30 April 1992).</date>
</sequence>
<sequence>
<author>Umrigar, Zerksis D. and Pitchumani, Vijay</author>
<date>(1985).</date>
<title>An experiment in programming with full first-order logic.</title>
<container-title>In Symposium of Logic Programming,</container-title>
<location>Boston, MA.</location>
<publisher>IEEE Computer Society Press.</publisher>
</sequence>
<sequence>
<author>van Arragon, Paul</author>
<date>(1990).</date>
<title>Nested Default Reasoning for User Modeling.</title>
<genre>PhD thesis,</genre>
<publisher>Department of Computer Science, University of Waterloo,</publisher>
<location>Waterloo, Ontario.</location>
<note>Published by the department as Research Report CS-90-25.</note>
</sequence>
<sequence>
<author>Eifrig, J., Smith, S., Trifonov, V., and Zwarico, A.</author>
<title>Application of OOP type theory: State, decid-ability, integration.</title>
<container-title>In Proc. Conference on Object-Oriented Programming Systems, Languages, and Applications</container-title>
<date>(Oct. 1994),</date>
<pages>pp. 16-30.</pages>
</sequence>
<sequence>
<author>MacWhinney, B.</author>
<date>(1993).</date>
<title>Connections and symbols: closing the gap.</title>
<journal>Cognition,</journal>
<volume>49 (3),</volume>
<pages>291-296.</pages>
</sequence>
<sequence>
<author>L. Lovasz and N. Young.</author>
<title>Lecture notes on evasiveness of graph properties.</title>
<genre>Technical Report CS-TR-317-91,</genre>
<publisher>Computer Science Department, Princeton University,</publisher>
<date>1991.</date>
</sequence>
<sequence>
<author>Azer Bestavros and Carlos Cunha.</author>
<title>Server-initiated document dissemination for the www.</title>
<journal>IEEE Data Engineering Bulletin,</journal>
<date>September 1996.</date>
<pages>Page 15</pages>
</sequence>
<sequence>
<author>Bunke, H., &amp; Allermann, G.</author>
<date>(1983).</date>
<title>Inexact graph matching for structural pattern recognition.</title>
<journal>Pattern Recognition Letters,</journal>
<volume>1 (4),</volume>
<pages>245-253.</pages>
</sequence>
<sequence>
<author>Kyriazis, G. C.,</author>
<title>Approximation Orders of Principal Shift-Invariant Spaces Generated by Box Splines,</title>
<edition>Preprint.</edition>
</sequence>
<sequence>
<author>A. Bricker, M. Litzkow, and M. Livny.</author>
<title>Condor Technical Summary.</title>
<genre>TR 1069,</genre>
<publisher>Computer Sciences Dept., Univ. of Wisconsin-Madison,</publisher>
<date>January 1992.</date>
</sequence>
<sequence>
<author>Laird, J. E., Jones, R. M., &amp; Nielsen, P. E.</author>
<date>(1994).</date>
<title>Coordinated behavior of computer generated forces in tacair-soar.</title>
<container-title>In Proceedings of the Fourth Conference on Computer Generated Forces and Behavioral Representation.</container-title>
<location>Orlando, Florida:</location>
<publisher>Institute for Simulation and Training, University of Central Florida.</publisher>
</sequence>
<sequence>
<author>Peot, M. A., &amp; Smith, D. E.</author>
<date>(1993).</date>
<title>Threat-removal strategies for partial-order planning.</title>
<container-title>In Proceedings of the Eleventh National Conference of the American Association for Artificial Intelligence (AAAI-93),</container-title>
<pages>pp. 492-499</pages>
<location>Washington, D. C.</location>
<publisher>Morgan Kaufmann.</publisher>
</sequence>
<sequence>
<author>J. Demmel, I. Dhillon, and H. Ren.</author>
<title>On the correctness of parallel bisection in floating point.</title>
<journal>ETNA,</journal>
<volume>3</volume>
<pages>116-149,</pages>
<date>1995.</date>
<note>(See also LAPACK Working Note No.70).</note>
</sequence>
<sequence>
<author>Sarita V. Adve.</author>
<title>Using information from the programmer to implement system optimizations without violating sequential consistency.</title>
<genre>Technical Report Technical report TR 9603</genre>
<note>(Submitted for publication),</note>
<publisher>Department of Electrical and Computer Engineering, Rice University,</publisher>
<date>March 1996.</date>
</sequence>
<sequence>
<author>Jia, R.-Q., and J. Lei,</author>
<title>Approximation by Multiinteger Translates of Functions Having Global Support,</title>
<journal>J. Approx. Theory</journal>
<volume>72</volume>
<date>(1993),</date>
<pages>2-23.</pages>
</sequence>
<sequence>
<editor>Rees, J. and W. Clinger (Eds.).</editor>
<title>The revised 3 report on the algorithmic language Scheme.</title>
<journal>SIGPLAN Notices</journal>
<volume>21(12),</volume>
<date>1986,</date>
<pages>37-79.</pages>
</sequence>
<sequence>
<author>Wettschereck, Dietrich, and Thomas G. Dietterich,</author>
<date>(1995).</date>
<title>An Experimental Comparison of Nearest-Neighbor and Nearest-Hyperrectangle Algorithms.</title>
<journal>Machine Learning,</journal>
<volume>Vol. 19, No. 1,</volume>
<pages>pp. 5-28.</pages>
</sequence>
<sequence>
<author>C. K. I. Williams.</author>
<title>Combining deformable models and neural networks for handprinted digit recognition.</title>
<genre>PhD thesis,</genre>
<publisher>Dept. of Computer Science, University of Toronto,</publisher>
<date>1994.</date>
</sequence>
<sequence>
<author>Mostow, J., &amp; Bhatnagar, N.</author>
<date>(1987).</date>
<title>Failsafe: A floor planner that uses ebg to learn from its failures.</title>
<container-title>In Proceedings IJCAI-87.</container-title>
</sequence>
<sequence>
<author>H. Raiffa.</author>
<title>The Art and Science of Negotiation.</title>
<publisher>Harvard Univ. Press,</publisher>
<location>Cambridge, Mass.,</location>
<date>1982.</date>
</sequence>
<sequence>
<author>Plotkin, G. D.</author>
<date>(1971a).</date>
<title>Automatic Methods of Inductive Inference.</title>
<genre>Ph.D. thesis,</genre>
<publisher>Edinburgh University.</publisher>
</sequence>
<sequence>
<author>T. E. Hull, T. F. Fairgrieve, and P. T. P. Tang.</author>
<title>Implementing complex elementary functions using exception handling.</title>
<journal>ACM Trans. Math. Softw.,</journal>
<volume>20(2)</volume>
<pages>215-244,</pages>
<date>1994.</date>
</sequence>
<sequence>
<author>Anoop Gupta, Andrew Tucker, and Shigeru Urushibara.</author>
<title>The impact of operating system scheduling policies and synchro nization methods on the performance of parallel applications.</title>
<container-title>In Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems,</container-title>
<pages>pages 120-132,</pages>
<date>May 1991.</date>
</sequence>
<sequence>
<author>Aaron Kershenbaum, David Musser, and Alexander Stepanov.</author>
<title>Higher order imperative programming.</title>
<genre>Technical report,</genre>
<publisher>Computer Science Department, Rensselaer Polytechnic Institute,</publisher>
<date>1988.</date>
</sequence>
<sequence>
<author>Card, S. K., Robertson, G. G., Mackinlay, J. D.,</author>
<title>The Information Visualizer, an Information Workspace,</title>
<container-title>Proceedings of Human Factors in Computing Systems (CHI91), 181188, ACM,</container-title>
<location>New York,</location>
<date>1991.</date>
</sequence>
<sequence>
<author>M. Wolfe,</author>
<title>``Optimizing supercompilers for supercomputers,''</title>
<publisher>Pitman Publishing Company,</publisher>
<location>London,</location>
<publisher>MIT Press,</publisher>
<location>Cambridge, Massachusets,</location>
<date>1989.</date>
</sequence>
<sequence>
<author>Plunkett, K., &amp; Marchman, V.</author>
<date>(1991).</date>
<title>U-shaped learning and frequency effects in a multilayered perceptron: Implications for child language acquisition.</title>
<journal>Cognition,</journal>
<volume>38,</volume>
<pages>43 - 102.</pages>
</sequence>
<sequence>
<author>William G. Cochran.</author>
<title>Sampling Techniques.</title>
<publisher>John Wiley and Sons, Inc.,</publisher>
<location>New York, New York,</location>
<edition>3 edition,</edition>
<date>1977.</date>
</sequence>
<sequence>
<author>Renals, Steve, and Richard Rohwer,</author>
<date>(1989).</date>
<title>Phoneme Classification Experiments Using Radial Basis Functions.</title>
<container-title>In Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN89),</container-title>
<volume>Vol. 1,</volume>
<pages>pp. 461-467.</pages>
</sequence>
<sequence>
<author>Selman, B., Levesque, H., &amp; Mitchell, D.</author>
<date>(1992).</date>
<title>A new method for solving hard satisfiability problems.</title>
<container-title>In Proceedings of AAAI-92,</container-title>
<pages>pp. 440-446.</pages>
<publisher>AAAI/MIT Press.</publisher>
</sequence>
<sequence>
<author>Rivest, R. L.</author>
<date>(1987).</date>
<title>Learning decision lists.</title>
<container-title>Machine Learning,</container-title>
<volume>2 (3),</volume>
<pages>229-246.</pages>
</sequence>
<sequence>
<author>McKinsey, J. C. C.</author>
<date>(1943).</date>
<title>The decision problem for some classes of sentences without quantifier.</title>
<journal>Journal of Symbolic Logic,</journal>
<volume>8 (3),</volume>
<pages>61-76.</pages>
</sequence>
<sequence>
<author>Schaffer, C.</author>
<date>(1992).</date>
<title>Sparse data and the effect of overfitting avoidance in decision tree induction.</title>
<container-title>In AAAI-92 Proceedings of the Tenth National Conference on Artificial Intelligence,</container-title>
<pages>pp. 147-152</pages>
<location>San Jose, CA.</location>
<publisher>AAAI Press.</publisher>
</sequence>
<sequence>
<author>C. Thekkath, H. Levy, and E. Lazowska.</author>
<title>Efficient Support for Multicomputing on ATM Networks.</title>
<genre>Technical Report TR93-04-03,</genre>
<publisher>Department of Computer Science and Engineering, University of Washington,</publisher>
<date>April 1993.</date>
</sequence>
<sequence>
<author>Mahadevan, S., &amp; Connell, J.</author>
<date>(1991).</date>
<title>"Automatic Programming of Behavoir-Based Robots Using Reinforcement Learning".</title>
<container-title>In AAAI,</container-title>
<pages>pp. 768-773.</pages>
</sequence>
<sequence>
<author>Robert A. Ballance, Arthur B. Maccabe, and Karl J. Ottenstein.</author>
<title>The program dependence web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages.</title>
<container-title>In Proc. of Sigplan '90 Conf. on Programming Language Design and Implementation,</container-title>
<pages>pages 257-271,</pages>
<date>1990.</date>
</sequence>
<sequence>
<author>Y. L. Chang and M. E. Marhic.</author>
<title>Fiber-optic ladder networks for inverse decoding coherent CDMA.</title>
<journal>Journal of Lightwave Technology,</journal>
<volume>10(12)</volume>
<pages>1952-1962,</pages>
<date>December 1992.</date>
</sequence>
<sequence>
<author>J. H. M. J. Daily and K. Reiser,</author>
<title>"Detecting obstacles in range imagery,"</title>
<container-title>Proc. of [ARPA] Image Understanding Workshop,</container-title>
<pages>pp. 87-97,</pages>
<date>1987.</date>
</sequence>
<sequence>
<author>Cousot, P. and Cousot, R.</author>
<date>1978.</date>
<title>Static determination of dynamic properties of recursive procedures.</title>
<container-title>In Proceedings of the IFIP Conference on Programming Concepts,</container-title>
<editor>E. Neuhold, Ed.</editor>
<publisher>North-Holland Pub. Co.,</publisher>
<pages>237-277.</pages>
</sequence>
<sequence>
<author>Oded Shmueli.</author>
<title>Decidability and expressiveness aspects of logic queries.</title>
<container-title>In Proceedings of the Sixth Symposium on Principles of Database Systems (PODS),</container-title>
<pages>pages 237-249,</pages>
<location>San Diego, CA,</location>
<date>March 1987.</date>
</sequence>
<sequence>
<author>Conklin, D., Fortier, S., &amp; Glasgow, J.</author>
<date>(1993a).</date>
<title>Knowledge discovery in molecular databases.</title>
<journal>IEEE Transactions on Knowledge and Data Engineering,</journal>
<pages>985-987.</pages>
<note>Special Issue on Learning and Discovery in Knowledge-Based Databases.</note>
</sequence>
<sequence>
<author>Huffman, D. A.</author>
<date>(1952).</date>
<title>A method for the construction of minimum redundancy codes.</title>
<journal>Proceedings of the Institute of Radio Engineers</journal>
<volume>40,</volume>
<pages>1098-1101.</pages>
</sequence>
<sequence>
<author>Baffes, P., &amp; Mooney, R.</author>
<date>(1993).</date>
<title>Symbolic revision of theories with M-of-N rules.</title>
<container-title>In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence,</container-title>
<pages>pp. 1135-1140,</pages>
<location>Chambery, France.</location>
<publisher>Morgan Kaufmann.</publisher>
</sequence>
<sequence>
<author>Lamaire, R. O, and D. N. Serpanos,</author>
<title>Two Dimensional Round Robin Schedulers for Packet Switches with Multiple Input Queues,</title>
<journal>IEEE/ACM Tr ans. on Networking,</journal>
<pages>pp. 471-482.</pages>
<date>(October 94).</date>
</sequence>
<sequence>
<author>McCarthy, J.</author>
<date>(1958).</date>
<title>Programs with common sense.</title>
<container-title>In Proceedings of the Symposium on the Mechanization of Thought Processes,</container-title>
<volume>Vol. 1,</volume>
<pages>pp. 77-84.</pages>
<publisher>National Physical Laboratory.</publisher>
<note>Reprinted in Minsky`s (ed.) Semantic Information Processing, MIT Press (1968), 403-409. Also in R. Brachman and H. Levesque, Readings in Knowledge Representation, 1985.</note>
</sequence>
<sequence>
<author>K. D. Cooper,</author>
<title>``Analyzing aliases of reference formal parameters'',</title>
<container-title>Proc. Twelfth POPL,</container-title>
<date>Jan. 1985.</date>
</sequence>
<sequence>
<author>Miller, G.</author>
<date>1995.</date>
<title>WordNet: A lexical database for English.</title>
<journal>Communications of the ACM</journal>
<volume>38</volume>
<pages>39-41</pages>
</sequence>
<sequence>
<author>A. Louri and H. Sung.</author>
<title>"A Compiler Directed Cache Coherence Scheme With Fast and Parallel Explicit Invalidation."</title>
<container-title>In Proc. of the 1992 International Conference on Parallel Processing,</container-title>
<pages>pages 2-9,</pages>
<date>Aug 1992.</date>
</sequence>
<sequence>
<author>G. Patnaik.</author>
<genre>Personal communication,</genre>
<date>September 1995.</date>
</sequence>
<sequence>
<author>Kennedy, A. D.</author>
<date>(1990)</date>
<title>"The theory of hybrid stochastic algorithms",</title>
<editor>in P. H. Damgaard, et al. (editors)</editor>
<container-title>Probabilistic Methods in Quantum Field Theory and Quantum Gravity,</container-title>
<location>New York:</location>
<publisher>Plenum Press.</publisher>
</sequence>
<sequence>
<author>J. Singh and J. Hennessy.</author>
<title>An empirical investigation of the effectiveness of and limitations of automatic parallelization.</title>
<container-title>In Proceedings of the International Symposium on Shared Memory Multiprocessors,</container-title>
<location>Tokyo, Japan,</location>
<date>April 1991.</date>
</sequence>
<sequence>
<author>D. J. Burr.</author>
<title>Elastic matching of line drawings.</title>
<journal>IEEE Trans. Pattern Analysis and Machine Intelligence,</journal>
<volume>3(6),</volume>
<pages>708-713,</pages>
<date>1981.</date>
</sequence>
<sequence>
<author>Wermuth, N., &amp; Lauritzen, S. L.</author>
<date>(1983).</date>
<title>Graphical and recursive models for contingency tables.</title>
<journal>Biometrika,</journal>
<volume>70,</volume>
<pages>537-552.</pages>
</sequence>
<sequence>
<author>D. Lomet and Mark R. Tuttle.</author>
<title>Redo Recovery after System Crashes.</title>
<container-title>In Proc. of the 21st International Conference on Very Large Data Bases,</container-title>
<location>Zurich,</location>
<date>Sept. 1995.</date>
</sequence>
<sequence>
<author>A. V. Aho, R. Sethi, and J. Ullman.</author>
<title>Compilers: Principles, Techniques, and Tools.</title>
<publisher>Addison-Wesley,</publisher>
<location>Reading, MA,</location>
<edition>second edition,</edition>
<date>1986.</date>
</sequence>
<sequence>
<author>B. Shneiderman.</author>
<title>Tree visualization with tree-maps: A 2-d space filling approach.</title>
<journal>ACM Transactions on Graphics,</journal>
<volume>11(1)</volume>
<pages>1-39,</pages>
<date>Jan. 1992.</date>
</sequence>
<sequence>
<author>Murthy, S. K., Kasif, S., Salzberg, S., &amp; Beigel, R.</author>
<date>(1993).</date>
<title>OC 1 Randomized induction of oblique decision trees.</title>
<container-title>In Proceedings of the Eleventh National Conference on Artificial Intelligence,</container-title>
<pages>pp. 322-327.</pages>
<location>Washington, D. C.</location>
<publisher>MIT Press.</publisher>
</sequence>
<sequence>
<author>Leroy, X.</author>
<title>Typage polymorphe d'un langage algorithmique.</title>
<genre>PhD thesis,</genre>
<publisher>Universite Paris</publisher>
<date>7, 1992.</date>
</sequence>
<sequence>
<author>Millroth, H.,</author>
<title>Reforming Compilation of Logic Programs,</title>
<genre>Ph.D. Thesis,</genre>
<publisher>Computing Science Department, Uppsala University,</publisher>
<date>1990.</date>
</sequence>
<sequence>
<author>Angrist, J., Imbens, G., &amp; Rubin, D.</author>
<date>(1995).</date>
<title>Identification of causal effects using instrumental variables.</title>
<journal>Journal of the American Statistical Association,</journal>
<note>in press.</note>
</sequence>
<sequence>
<author>D. Padua and M. J. Wolfe.</author>
<title>Advanced compiler optimizations for supercomputers.</title>
<journal>Communications of the ACM,</journal>
<volume>29(12)</volume>
<pages>1184-1201,</pages>
<date>December 1986.</date>
</sequence>
<sequence>
<author>Wellman Kephart, J. O., Hogg, T., &amp; Huberman, B. A.</author>
<date>(1989).</date>
<title>Dynamics of computational ecosystems.</title>
<journal>Physical Review A,</journal>
<volume>40,</volume>
<pages>404-421.</pages>
</sequence>
<sequence>
<author>Jeffrey Kuskin, David Ofelt, Mark Heinrich, John Heinlein, Richard Simoni, Kourosh Gharachorloo, John Chapin, David Nakahira, Joel Baxter, Mark Horowitz, Anoop Gupta, Mendel Rosenbaum, and John Hennessy.</author>
<title>The Stanford FLASH multiprocessor.</title>
<container-title>In Proceedings of the 21st Annual International Conference on Computer Architecture,</container-title>
<pages>pages 302-313,</pages>
<date>April 1994.</date>
</sequence>
<sequence>
<author>T. A. Cook and E. A. Harcourt.</author>
<title>A functional specification language for instruction set architectures.</title>
<container-title>In Proc. 1994 International Conference on Computer Languages,</container-title>
<pages>pages 11-19,</pages>
<date>1994.</date>
</sequence>
<sequence>
<author>A. L. Yuille.</author>
<title>Deformable templates for face recognition.</title>
<journal>Journal of Cognitive Neuroscience,</journal>
<volume>3(1)</volume>
<pages>59-70,</pages>
<date>1991.</date>
</sequence>
<sequence>
<author>F. Facchinei and C. Kanzow.</author>
<title>On unconstrained and constrained stationary points of the implicit Lagrangian.</title>
<journal>Journal of Optimization Theory and Applications,</journal>
<volume>92</volume>
<pages>99-115,</pages>
<date>1997.</date>
</sequence>
<sequence>
<author>N. A. Lorentzos and Y. G. Mitsopoulos.</author>
<title>SQL Extension for Interval Data.</title>
<journal>IEEE TKDE,</journal>
<volume>9(3)</volume>
<pages>480-499,</pages>
<date>May 1997.</date>
</sequence>
<sequence>
<author>M. J. Harrold and M. L. Soffa,</author>
<title>"An Incremental Approach to Unit Testing During Maintenance,"</title>
<container-title>Proc. of the Conference on Software Maintenance,</container-title>
<pages>pages 362-367,</pages>
<date>1988.</date>
</sequence>
<sequence>
<author>Friedman, J. H., &amp; Stuetzle, W.</author>
<date>(1981).</date>
<title>Projection pursuit regression.</title>
<journal>Journal of the American Statistics Association,</journal>
<volume>76,</volume>
<pages>817-823.</pages>
</sequence>
<sequence>
<author>R. Fikes, M. Cutkosky, T. Gruber, and J. V. Baalen.</author>
<title>Knowledge Sharing Technology Project Overview.</title>
<genre>Technical Report KSL-91-71,</genre>
<publisher>Knowledge Systems Laboratory, Stanford University,</publisher>
<date>1991.</date>
</sequence>
<sequence>
<author>J. Adams, W. Brainerd, J. Martin, B. Smith, and J. Wagener.</author>
<title>Fortran 90 Handbook.</title>
<publisher>McGraw-Hill,</publisher>
<location>New York, NY,</location>
<date>1992.</date>
</sequence>
<sequence>
<author>Ruth Shapira.</author>
<title>A note on Sugihara's claim.</title>
<journal>IEEE Transactions on Pattern Analysis and Machine Intelligence,</journal>
<volume>6(1)</volume>
<pages>122-123,</pages>
<date>1984.</date>
</sequence>
<sequence>
<author>Howard Turtle and W. Bruce Croft.</author>
<title>Inference networks for document retrieval.</title>
<editor>In Jean-Luc Vidick, editor,</editor>
<container-title>Proceedings of the 13th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval,</container-title>
<pages>pages 1-24,</pages>
<location>Brussels, Belgium,</location>
<date>September 1990.</date>
</sequence>
<sequence>
<author>Dwork, C., Kanellakis, P. C., and Mitchell, J. C.,</author>
<title>On the sequential nature of unification,</title>
<journal>Journal of Logic Programming</journal>
<volume>1</volume>
<pages>pp. 35-50</pages>
<date>(1984).</date>
</sequence>
<sequence>
<author>Jin-yi Cai</author>
<date>(1990),</date>
<title>A Note on the Determinant and Permanent Problem,</title>
<journal>Information and Computation,</journal>
<volume>84, No. 1,</volume>
<pages>119-127.</pages>
</sequence>
<sequence>
<author>Rao, A. S., Georgeff, M. P., &amp; Sonenberg, E.</author>
<date>(1991).</date>
<title>Social plans: a preliminary report.</title>
<container-title>In Pre-Proceedings of the Third European Workshop on Modeling Autonomous Agents and Multi-Agent Worlds</container-title>
<location>Germany.</location>
</sequence>
<sequence>
<author>Gentner, D. and Markman, A. B.</author>
<date>(1992).</date>
<title>Analogy Watershed or Waterloo? Structural alignment and the development of connectionist models of analogy.</title>
<editor>In Giles, C. L., Hanson, S. J., and Cowan, J. D., editors,</editor>
<container-title>Advances in Neural Information Processing Systems 5 (NIPS*92),</container-title>
<pages>pages 855-862,</pages>
<location>San Mateo, CA.</location>
<publisher>Morgan Kaufmann.</publisher>
</sequence>
<sequence>
<editor>Paul Hudak, Simon Peyton Jones, and Philip Wadler (Editors).</editor>
<title>Report on the Programming Language Haskell, version 1.2.</title>
<journal>ACM SIGPLAN Notices,</journal>
<volume>27(5),</volume>
<date>1992.</date>
</sequence>
<sequence>
<author>Hill, P. M. and Lloyd, J. W.,</author>
<title>The Godel Programming Language,</title>
<publisher>MIT Press,</publisher>
<location>Cambridge, Mass.,</location>
<date>1994.</date>
</sequence>
<sequence>
<author>Shoham, Y.</author>
<date>(1988).</date>
<title>Reasoning about Change.</title>
<location>Cambridge, MA:</location>
<publisher>MIT Press.</publisher>
</sequence>
<sequence>
<author>T. J. Sabin, C. A. L. Bailer-Jones, S. M. Roberts, D. J. C. MacKay, P. J. Withers,</author>
<note>to be presented at THERMEC 97 (International Conference on Thermomechanical Processing),</note>
<date>July 1997.</date>
</sequence>
<sequence>
<author>Roland Wismuller.</author>
<title>Debugging of globally optimized programs using data flow analysis.</title>
<container-title>In Proceedings of the ACM/SIGPLAN Conference on Programming Language Design and Implementation,</container-title>
<pages>pages 278-289.</pages>
<publisher>ACM,</publisher>
<date>June 1994.</date>
<note>Available via WWW from</note>
<url>http://wwwbode.informatik.tu-muenchen.de/~wismuell/publications.html</url>
</sequence>
<sequence>
<author>P. Evripidou and J-L. Gaudiot,</author>
<title>"The USC decoupled multilevel data-flow execution model,"</title>
<editor>In Jean-Luc Gaudiot and Lubomir Bic, editors,</editor>
<container-title>Advanced Topics in Data-Flow Computing,</container-title>
<pages>pages 347-379.</pages>
<location>New Jersey:</location>
<publisher>Prentice Hall,</publisher>
<date>1991.</date>
</sequence>
<sequence>
<author>Cherri M. Pancake and Sue Utter.</author>
<title>Models for visualization in parallel debuggers.</title>
<container-title>In Proceedings Supercomputing '89,</container-title>
<date>November 1989.</date>
</sequence>
<sequence>
<author>Gupta, R., Smolka, S., &amp; Bhaskar, S.</author>
<date>(1994).</date>
<title>On randomization in sequential and distributed algorithms.</title>
<journal>ACM Computing Surveys,</journal>
<volume>26 (1),</volume>
<pages>7-86.</pages>
</sequence>
<sequence>
<author>H. Lu, S. Dwarkadas, A. Cox, and W. Zwaenepoel.</author>
<title>Message passing versus distributed shared memory on networks of workstations.</title>
<container-title>In Proceedings SuperComputing '95,</container-title>
<date>Dec. 1995.</date>
</sequence>
<sequence>
<author>A. Garvey and V. R. Lesser,</author>
<title>"Design-to-time Real-Time Scheduling",</title>
<journal>IEEE Transactions on Systems, Man, and Cybernetics:</journal>
<note>Special Issue on Scheduling, Planning, and Control,</note>
<volume>23(6),</volume>
<date>1993.</date>
</sequence>
<sequence>
<author>Gertz M., Lipeck U. W.</author>
<title>Deriving Integrity Maintaining Triggers from Transition Graphs.</title>
<container-title>In International Conference on Data Engineering,</container-title>
<date>1993.</date>
</sequence>
<sequence>
<author>D. G. Bradlee, S. J. Eggers and R. R. Henry,</author>
<title>Integrating Register Allocation and Instruction Scheduling for RISCs,</title>
<container-title>Proc. Fourth International Conf. on ASPLOS,</container-title>
<location>Santa Clara, CA,</location>
<date>April 8-11, 1991,</date>
<pages>pp. 122-131.</pages>
</sequence>
<sequence>
<author>B. Ryder and M. Paull.</author>
<title>Incremental data flow analysis algorithms.</title>
<journal>ACM Transactions on Programming Languages and Systems,</journal>
<volume>10(1)</volume>
<pages>1-50,</pages>
<date>January 1988.</date>
</sequence>
<sequence>
<author>Weiss, S., &amp; Indurkhya, N.</author>
<date>(1993a).</date>
<title>Optimized Rule Induction.</title>
<journal>IEEE Expert,</journal>
<volume>8 (6),</volume>
<pages>61-69.</pages>
</sequence>
<sequence>
<author>Sutherland, I.</author>
<title>Sketchpad: A Man-Machine Graphical Communication System,</title>
<genre>Tech Report #296,</genre>
<publisher>MIT Lincoln Labs,</publisher>
<location>Cambridge, MA,</location>
<date>1963.</date>
</sequence>
<sequence>
<author>Zhai, S. &amp; Milgram, P.</author>
<date>(1991).</date>
<title>A telerobotic virtual control system.</title>
<container-title>Proceedings of SPIE 1612, Cooperative Intelligent Robotics in Space II,</container-title>
<pages>(pp. 311-320).</pages>
<location>Boston, MA.</location>
</sequence>
<sequence>
<author>J. Anderson,</author>
<title>"Composite Registers",</title>
<journal>Distributed Computing,</journal>
<volume>6(3),</volume>
<date>1993,</date>
<pages>pp. 141-154.</pages>
</sequence>
<sequence>
<author>Ventura, Dan,</author>
<date>(1995).</date>
<title>On Discretization as a Preprocessing Step for Supervised Learning Models,</title>
<genre>Masters Thesis,</genre>
<publisher>Department of Computer Science, Brigham Young University.</publisher>
</sequence>
<sequence>
<author>Amdur, E. S.</author>
<title>On the Message Complexity of Byzantine Agreement.</title>
<genre>Master's Thesis,</genre>
<publisher>Department of Computer Science, University of Toronto,</publisher>
<date>September 1988.</date>
</sequence>
<sequence>
<author>Plunkett, K., &amp; Marchman, V.</author>
<date>(1991).</date>
<title>U-shaped learning and frequency effects in a mul-tilayered perceptron: Implications for child language acquisition.</title>
<journal>Cognition,</journal>
<volume>38,</volume>
<pages>43 - 102.</pages>
</sequence>
<sequence>
<editor>In Wrobel, S. (Ed.),</editor>
<container-title>Proceedings of the Fourth International Workshop on Inductive Logic Programming</container-title>
<location>Bad Honnef/Bonn, Germany.</location>
</sequence>
<sequence>
<author>K. Keeton, B. A. Mah, S. Seshan, R. H. Katz, and D. Ferrari.</author>
<title>Providing Connection-Oriented Service to Mobile Hosts.</title>
<container-title>In Proceedings of the First USENIX Symposium on Mobile and Location-Independent Computing,</container-title>
<date>August 1993.</date>
</sequence>
<sequence>
<author>Parr, R., &amp; Russell, S.</author>
<date>(1995).</date>
<title>Approximating optimal polices for partially observable stochastic domains.</title>
<container-title>In Proceedings of IJCAI-95,</container-title>
<pages>1088-1094.</pages>
</sequence>
<sequence>
<author>Bennett, K. H., Bull, T. and Yang, H.,</author>
<title>"A Transformation System for Maintenance | Turning Theory into Practice",</title>
<container-title>IEEE Conference on Software Maintenance-1992,</container-title>
<location>Orlando, Florida,</location>
<date>November, 1992.</date>
</sequence>
<sequence>
<author>J. M. Lalouel.</author>
<title>GEMINI a computer program for optimization of general nonlinear functions.</title>
<genre>Technical Report 14,</genre>
<publisher>University of Utah, Department of Medical Biophysics and Computing,</publisher>
<location>Salt Lake City, Utah,</location>
<date>1979.</date>
</sequence>
<sequence>
<author>Cau, A. and Zedan, H.,</author>
<title>"Refining Interval Temporal Logic specifications",</title>
<genre>Draft Paper,</genre>
<date>November 1996.</date>
</sequence>
<sequence>
<author>Dempster, A., Laird, N., and Rubin, D.</author>
<date>(1977)</date>
<title>Maximum likelihood from incomplete data via the EM algorithm.</title>
<journal>Journal of the Royal Statistical Society</journal>
<volume>B39,</volume>
<pages>1-38.</pages>
</sequence>
<sequence>
<author>Michalski, Ryszard S., Robert E. Stepp, and Edwin Diday,</author>
<date>(1981).</date>
<title>A Recent Advance in Data Analysis: Clustering Objects into Classes Characterized by Conjunctive Concepts.</title>
<container-title>Progress in Pattern Recognition,</container-title>
<volume>Vol. 1,</volume>
<editor>Laveen N. Kanal and Azriel Rosenfeld (Eds.).</editor>
<location>New York:</location>
<publisher>North-Holland,</publisher>
<pages>pp. 33-56.</pages>
</sequence>
<sequence>
<author>Tambe, M.</author>
<date>(1996).</date>
<title>Tracking dynamic team activity.</title>
<container-title>In Proceedings of the National Conference on Artificial Intelligence (AAAI).</container-title>
</sequence>
<sequence>
<author>Valiant, L. G.</author>
<date>(1984).</date>
<title>A theory of the learnable.</title>
<journal>Communications of the ACM,</journal>
<volume>27 (11).</volume>
</sequence>
<sequence>
<author>D. Georgakopoulos, M. Rusinkiewicz, and A. Sheth.</author>
<title>Using tickets to enforce the serializability of multidatabase transactions.</title>
<journal>IEEE Trans. on Knowledge and Data Eng.,</journal>
<volume>6(1)</volume>
<pages>166,</pages>
<date>February 1994.</date>
</sequence>
<sequence>
<author>J. Kim and P. Khosla,</author>
<title>"Real-time obstacle avoidance using harmonic potential functions,"</title>
<genre>Tech. Report COMPSI T-RA 8,</genre>
<pages>pp. 338-349,</pages>
<date>1992.</date>
</sequence>
<sequence>
<author>Surajit Chaudhuri and Moshe Vardi.</author>
<title>On the equivalence of recursive and nonrecursive data-log programs.</title>
<container-title>In The Proceedings of the PODS-92,</container-title>
<pages>pages 55-66,</pages>
<date>1992.</date>
</sequence>
<sequence>
<author>Verlinden, J., Bolter, J. D., &amp; van der Mast, C.</author>
<title>Voice Annotation in Virtual Environments,</title>
<note>paper submitted to ESS '93.</note>
</sequence>
<sequence>
<author>Lisa F. Rau.</author>
<title>Extracting company names from text.</title>
<container-title>In Proceedings of the Sixth IEEE Conference on Artificial Intelligence Applications,</container-title>
<date>1991.</date>
</sequence>
<sequence>
<author>C. Norris and L. Pollock,</author>
<title>"A scheduler-sensitive global register allocator,"</title>
<container-title>In Proc. of Supercomputing,</container-title>
<pages>pages 804-813,</pages>
<date>1993.</date>
</sequence>
<sequence>
<author>Jeffay, K., Stone, D. L., Smith, F. D.,</author>
<title>Kernel Support for Live Digital Audio and Video,</title>
<journal>Computer Communications,</journal>
<volume>Vol. 15, No. 6</volume>
<date>(July / August 1992),</date>
<pages>pp. 388-395.</pages>
</sequence>
<sequence>
<author>A. Demers, S. Keshav, and S. Shenker.</author>
<title>Analysis and simulation of a fair queueing algorithm.</title>
<journal>Internetworking:Research and Experience,</journal>
<volume>1</volume>
<pages>3-26</pages>
</sequence>
<sequence>
<author>Fikes, R. E., Hart, P. E., &amp; Nilsson, N. J.</author>
<date>(1972).</date>
<title>Learning and executing generalized robot plans.</title>
<journal>Artificial Intelligence,</journal>
<volume>3,</volume>
<pages>251-288.</pages>
</sequence>
<sequence>
<author>Zhang, Z., &amp; Faugeras, O.</author>
<date>(1992).</date>
<title>3D Dynamic Scene Analysis.</title>
<publisher>Springer-Verlag.</publisher>
</sequence>
<sequence>
<author>Hawley, D. K., &amp; McClure, W. R.</author>
<date>(1983).</date>
<title>Compilation and analysis of escherichia coli promoter DNA sequences.</title>
<journal>Nucleic Acids Research,</journal>
<volume>11 (8),</volume>
<pages>2237-2255.</pages>
</sequence>
<sequence>
<author>M. Kamath and K. Ramamritham.</author>
<title>Modeling, Correctness &amp; Systems Issues in Supporting Advanced Database Applications using Workflow Management Systems.</title>
<genre>Technical Report TR 95-50,</genre>
<publisher>University of Massachusetts, Computer Science Dept.,</publisher>
<date>1995.</date>
</sequence>
<sequence>
<author>M. J. Harrold and M. L. Soffa,</author>
<title>``An incremental approach to unit testing during maintenance,''</title>
<container-title>Proceedings of the International Conference on Software Maintenance,</container-title>
<pages>pp. 362-367,</pages>
<date>October 1988.</date>
</sequence>
<sequence>
<author>VanLehn, K., Jones, R. M., &amp; Chi, M. T. H.</author>
<date>(1992).</date>
<title>A model of the self-explanation effect.</title>
<journal>Journal of the Learning Sciences,</journal>
<volume>2 (1),</volume>
<pages>1-59.</pages>
</sequence>
<sequence>
<author>Boddy, M.,</author>
<date>1991.</date>
<title>Any Time Problem Solving Using Dynamic Programming.</title>
<container-title>In Proceedings AAAI-91.</container-title>
<publisher>AAAI.</publisher>
</sequence>
<sequence>
<author>Jurafsky, D., Wooters, C., Tajchman, G., Segal, J., Stolcke, A., Fosler, E., &amp; Morgan, N.</author>
<date>(1994a).</date>
<title>The Berkeley Restaurant Project.</title>
<container-title>In Proceedings of the International Conference on Speech and Language Processing.</container-title>
<pages>pp. 2139-2142,</pages>
<location>Yokohama, Japan.</location>
</sequence>
<sequence>
<author>Alon Y. Levy, Divesh Srivastava, and Thomas Kirk.</author>
<title>Data model and query evaluation in global information systems.</title>
<journal>Journal of Intelligent Information Systems,</journal>
<date>1995.</date>
<note>Special Issue on Networked Information Discovery and Retrieval (to appear).</note>
</sequence>
<sequence>
<author>Sussman, G. J.</author>
<date>(1975).</date>
<title>A Computer Model of Skill Acquisition.</title>
<location>New York:</location>
<publisher>American Elsevier.</publisher>
</sequence>
<sequence>
<author>Crawford, J., &amp; Auton, L.</author>
<date>(1993).</date>
<title>Experimental results on the crossover point in satisfiability problems.</title>
<container-title>Proceedings of the 11th National Conference on Artificial Intelligence,</container-title>
<pages>21-27.</pages>
</sequence>
<sequence>
<author>Hermans, J., Habbema, J. D. F., &amp; Van der Burght, A. T.</author>
<date>(1974).</date>
<title>Cases of doubt in allocation problems, k populations.</title>
<journal>Bulletin of the International Statistics Institute,</journal>
<volume>45,</volume>
<pages>523-529.</pages>
</sequence>
<sequence>
<author>Reichman, R.</author>
<date>(1985).</date>
<title>Getting Computers to Talk Like You and Me: Discourse Context, Focus, and Semantics.</title>
<location>Cambridge, MA:</location>
<publisher>MIT Press.</publisher>
</sequence>
<sequence>
<author>K. Chandy and J. Misra,</author>
<title>Parallel Program Design: A Foundation,</title>
<publisher>Addison-Wesley,</publisher>
<date>1988.</date>
</sequence>
<sequence>
<author>S. L. Peyton Jones &amp; P. L. Wadler</author>
<date>[Jan 1993],</date>
<title>"Imperative functional programming,"</title>
<container-title>in 20th ACM Symposium on Principles of Programming Languages,</container-title>
<location>Charleston,</location>
<publisher>ACM,</publisher>
<pages>71-84.</pages>
</sequence>
<sequence>
<author>Nishida, T., &amp; et al.</author>
<date>(1991).</date>
<title>Automated phase portrait analysis by integrating qualitative and quantitative analysis.</title>
<container-title>In Proceedings of AAAI.</container-title>
</sequence>
<sequence>
<author>Kosslyn, S. M.</author>
<date>(1994).</date>
<title>Image and Brain: the resolution of the imagery debate.</title>
<publisher>MIT Press.</publisher>
</sequence>
<sequence>
<author>Shoham, Y., &amp; Tennenholtz, M.</author>
<date>(1994).</date>
<title>Co-learning and the evolution of social activity.</title>
<genre>Tech. rep. STAN-CS-TR-94-1511,</genre>
<publisher>Dept. of Computer Science, Stanford University.</publisher>
</sequence>
<sequence>
<author>Reiter, R.</author>
<date>(1980).</date>
<title>A logic for default reasoning.</title>
<journal>Artificial Intelligence,</journal>
<volume>13,</volume>
<pages>81-132.</pages>
</sequence>
<sequence>
<author>L. Hernquist,</author>
<title>"Vectorization of Tree Traversals,"</title>
<journal>Journal of Computational Physics,</journal>
<volume>vol. 87,</volume>
<date>1990.</date>
</sequence>
<sequence>
<author>Kibler, D., and David W. Aha,</author>
<date>(1987).</date>
<title>Learning representative exemplars of concepts: An initial case study.</title>
<container-title>Proceedings of the Fourth International Workshop on Machine Learning.</container-title>
<location>Irvine, CA:</location>
<publisher>Morgan Kaufmann,</publisher>
<pages>pp. 24-30.</pages>
</sequence>
<sequence>
<author>Kohonen, Teuvo,</author>
<date>(1990).</date>
<title>The Self-Organizing Map.</title>
<container-title>In Proceedings of the IEEE,</container-title>
<volume>Vol. 78, No. 9,</volume>
<pages>pp. 1464-1480.</pages>
</sequence>
<sequence>
<author>F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante.</author>
<title>An overview of the PTRAN analysis system for multiprocessing.</title>
<container-title>In Proceedings of the First International Conference on Supercomputing.</container-title>
<publisher>Springer-Verlag,</publisher>
<location>Athens, Greece,</location>
<date>June 1987.</date>
</sequence>
<sequence>
<author>M. Burke and R. Cytron,</author>
<title>``Interprocedural dependence analysis and parallelization'',</title>
<container-title>Proc. SIGPLAN 86 Symposium on Compiler Construction, SIGPLAN Notices</container-title>
<volume>21(7),</volume>
<date>July 1986.</date>
</sequence>
<sequence>
<author>D. Haussler.</author>
<title>Quantifying inductive bias: AI learning algorithms and Valiant's learning framework.</title>
<journal>Artificial Intelligence,</journal>
<date>1988.</date>
</sequence>
<sequence>
<author>Litman, D., &amp; Hirschberg, J.</author>
<date>(1990).</date>
<title>Disambiguating cue phrases in text and speech.</title>
<container-title>In Proceedings of the Thirteenth International Conference on Computational Linguistics (COLING).</container-title>
</sequence>
<sequence>
<author>Jaswinder Pal Singh, Wolf-Dietrich Weber, and Anoop Gupta.</author>
<title>SPLASH: Stanford Parallel Applications for Shared Memory.</title>
<journal>Computer Architecture News,</journal>
<volume>20(1),</volume>
<pages>5-44,</pages>
<date>March 1992.</date>
</sequence>
<sequence>
<author>Forbus, K. D.</author>
<date>(1989).</date>
<title>Introducing Actions in Qualitative Simulation.</title>
<container-title>Proceedings of IJCAI-89,</container-title>
<pages>1273-1278.</pages>
</sequence>
<sequence>
<author>M. C. Rinard and M. S. Lam.</author>
<title>Semantic foundations of Jade.</title>
<container-title>In Record of the Nineteenth Annual ACM Symposium on Principles of Programming Languages,</container-title>
<pages>pages 105-118,</pages>
<date>January 1992.</date>
</sequence>
<sequence>
<author>Webber, Bonnie Lynn and Mays, Eric</author>
<date>(1983).</date>
<title>Varieties of user misconceptions: Detection and correction.</title>
<container-title>In Proceedings of the Eighth International Joint Conference on Artificial Intelligence,</container-title>
<location>Karlsruhe.</location>
<pages>pages 650-652.</pages>
</sequence>
<sequence>
<author>C. Baru, O. Frieder, D. Kandlur, and M. Segal.</author>
<title>Join on a cube: Analysis, simulation, and implementation.</title>
<editor>In M. Kitsuregawa and H. Tanaka, editors,</editor>
<container-title>Database Machines and Knowledge Base Machines.</container-title>
<publisher>Kluwer Academic Publishers,</publisher>
<date>1987.</date>
</sequence>
<sequence>
<author>Pryor, L., &amp; Collins, G.</author>
<date>(1993).</date>
<title>Cassandra: Planning with contingencies.</title>
<genre>Technical report 41,</genre>
<publisher>Institute for the Learning Sciences, Northwestern University.</publisher>
</sequence>
<sequence>
<author>Harper, M. P., &amp; Helzerman, R. A.</author>
<date>(1995b).</date>
<title>Managing multiple knowledge sources in constraint-based parsing of spoken language.</title>
<journal>Fundamenta Informaticae,</journal>
<volume>23 (2, 3, 4),</volume>
<pages>303-353.</pages>
</sequence>
<sequence>
<author>Mark Friedell, Mark LaPolla, Sandeep Kochhar, Steve Sistare, and Janusz Juda.</author>
<title>Visualizing the behavior of massively parallel programs.</title>
<container-title>In Proceedings Supercomputing '91,</container-title>
<date>November 1991.</date>
</sequence>
<sequence>
<author>Michael Stonebraker, Anant Jhingaran, Jef-frey Goh, and Spyros Potamianos.</author>
<title>On rules, procedures, caching and views in databases.</title>
<genre>Technical Report UCB/ERL M90/36,</genre>
<publisher>University of California,</publisher>
<location>Berkeley,</location>
<date>April 1990.</date>
</sequence>
<sequence>
<author>Arvind Krishnamurthy and Katherine Yelick.</author>
<title>Optimizing parallel programs with explicit synchronization.</title>
<container-title>In Proceedings of the ACM SIG-PLAN '95 Conference on Programming Language Design and Implementation,</container-title>
<date>July 1995.</date>
</sequence>
<sequence>
<author>I. Koren and A. D. Singh,</author>
<title>"Fault Tolerance in VLSI Circuits,"</title>
<journal>Computer,</journal>
<note>Special Issue on Fault-Tolerant Systems,</note>
<volume>Vol. 23, No. 7,</volume>
<pages>pp. 73-83,</pages>
<date>July 1990.</date>
</sequence>
<sequence>
<author>Krogh, A., &amp; Vedelsby, J.</author>
<date>(1995).</date>
<title>Neural network ensembles, cross validation, and active learning.</title>
<editor>In Tesauro, G., Touretzky, D., &amp; Leen, T. (Eds.),</editor>
<container-title>Advances in Neural Information Processing Systems,</container-title>
<volume>Vol. 7,</volume>
<pages>pp. 231-238,</pages>
<location>Cambridge, MA.</location>
<publisher>MIT Press.</publisher>
</sequence>
<sequence>
<author>Stephen Lindell</author>
<date>(1992),</date>
<title>A Purely Logical Characterization of Circuit Uniformity,</title>
<container-title>Seventh IEEE Structure in Complexity Theory,</container-title>
<pages>185-192.</pages>
</sequence>
<sequence>
<author>Brieman, L., Friedman, J., Olshen, R., &amp; Stone, C.</author>
<date>(1984).</date>
<title>Classification and Regression Trees.</title>
<location>Monterey, CA:</location>
<publisher>Wadsworth and Brooks.</publisher>
</sequence>
<sequence>
<author>S. P. Amarasinghe, J. M. Anderson, C. S. Wilson, S.-W. Liao, B. M. Murphy, R. S. French, M. S. Lam, and M. W. Hall.</author>
<title>Multiprocessors from a software perspective.</title>
<journal>IEEE Micro,</journal>
<pages>pages 5261,</pages>
<date>June 1996.</date>
</sequence>
<sequence>
<author>Y. Breitbart, A. Silberschatz, and G. R. Thompson.</author>
<title>An approach to recovery management in a multidatabase system.</title>
<journal>The VLDB Journal,</journal>
<volume>1(11),</volume>
<date>July 1992.</date>
</sequence>
<sequence>
<author>D. R. Helman, D. A. Bader, and J. JaJa.</author>
<title>Parallel Algorithms for Personalized Communication and Sorting With an Experimental Study.</title>
<container-title>In Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures,</container-title>
<pages>pages 211-220,</pages>
<location>Padua, Italy,</location>
<date>June 1996.</date>
</sequence>
<sequence>
<author>Frank Kappe, Hermann Maurer, and Nick Sherbakov.</author>
<title>Hyper-G a universal hypermedia system.</title>
<journal>Journal of Educational Multimedia and Hypermedia,</journal>
<volume>2(1)</volume>
<pages>39-66,</pages>
<date>1993.</date>
</sequence>
<sequence>
<author>Dyn, N. and A. Ron</author>
<date>(1993)</date>
<title>"Radial basis function approximation: from gridded centres to scattered centres",</title>
<genre>CMS Technical Summary Report #94-3,</genre>
<publisher>University of Wisconsin-Madison.</publisher>
</sequence>
<sequence>
<author>J. Wiener, H. Gupta, W. Labio, Y. Zhuge, H. Garcia-Molina, and J. Widom.</author>
<title>A system prototype for warehouse view maintenance.</title>
<container-title>In The Workshop on Materialized Views,</container-title>
<pages>pages 26-33,</pages>
<date>June 1996.</date>
</sequence>
<sequence>
<author>Albert Croker and David Maier.</author>
<title>A Dynamic Tree-Locking Protocol.</title>
<container-title>In Proceedings of the International Conference in Data Engineering,</container-title>
<pages>pages 49-56,</pages>
<location>Los Angeles, CA,</location>
<date>1986.</date>
</sequence>
<sequence>
<author>R. Graham.</author>
<title>Bounds on multiprocessing timing anomalies.</title>
<journal>SIAM Journal of Computing,</journal>
<volume>17</volume>
<pages>416 - 429,</pages>
<date>1969.</date>
</sequence>
<sequence>
<author>M. Holliday and M. Stumm.</author>
<title>Performance evaluation of hierarchical ring-based shared memory mutliprocessors.</title>
<genre>Technical Report CS-1992-18,</genre>
<publisher>Computer Science Department, Duke University,</publisher>
<date>1992.</date>
</sequence>
<sequence>
<author>C. Forsyth.</author>
<title>Implementation of the worst-case execution analyser.</title>
<genre>Technical Report Hard Real-Time Operating System Kernel Study Task 8,</genre>
<volume>Volume E,</volume>
<publisher>York Software Engineering Ltd,</publisher>
<date>July 1992.</date>
</sequence>
<sequence>
<author>J. P. Callan,</author>
<title>"Document Filtering With Inference Networks,"</title>
<container-title>Proceedings of SIGIR,</container-title>
<pages>262-269,</pages>
<date>1996.</date>
</sequence>
<sequence>
<author>Deutsch, A.</author>
<title>Modeles Operationnels de Language de Programmation et Representations de Relations sue des Languages Rationnels avec Application a la Determination Statique de Proprietes de Partages Dy-namiques de Donnees.</title>
<genre>PhD thesis,</genre>
<publisher>Universite Paris VI,</publisher>
<date>1992.</date>
</sequence>
<sequence>
<author>J.-S. Pang and S. A. Gabriel,</author>
<title>NE/SQP: A robust algorithm for the nonlinear complementarity problem,</title>
<journal>Math. Programming,</journal>
<volume>60</volume>
<date>(1993),</date>
<pages>pp. 295-337.</pages>
</sequence>
<sequence>
<author>Allen, James F.</author>
<date>(1979).</date>
<title>A Plan-Based Approach to Speech Act Recognition.</title>
<genre>PhD thesis,</genre>
<publisher>Department of Computer Science, University of Toronto,</publisher>
<location>Toronto, Canada.</location>
<note>Published as University of Toronto, Department of Computer Science Technical Report No. 131.</note>
</sequence>
<sequence>
<author>Danvy, O. and A. Filinski.</author>
<title>Representing control: A study of the CPS transformation.</title>
<genre>Tech. Rpt. CIS-91-2.</genre>
<publisher>Kansas State University,</publisher>
<date>1991.</date>
</sequence>
<sequence>
<author>E. Allender, N. Immerman, J. Balcazar</author>
<date>(1993),</date>
<title>A First-Order Isomor-phism Theorem,</title>
<container-title>STACS,</container-title>
<pages>163-174.</pages>
</sequence>
<sequence>
<author>Milgrom, P., &amp; Roberts, J.</author>
<date>(1991).</date>
<title>Adaptive and sophisticated learning in normal form games.</title>
<journal>Games and Economic Behavior,</journal>
<volume>3,</volume>
<pages>82-100.</pages>
</sequence>
<sequence>
<author>Lovejoy, W. S.</author>
<date>(1991b).</date>
<title>Computationally feasible bounds for partially observed Markov decision processes.</title>
<journal>Operations Research,</journal>
<volume>39 (1),</volume>
<pages>162-175.</pages>
</sequence>
<sequence>
<author>Spirtes, P., Glymour, C., &amp; Scheines, R.</author>
<date>(1993).</date>
<title>Causation, Prediction, and Search.</title>
<publisher>Springer-Verlag,</publisher>
<location>New York.</location>
</sequence>
<sequence>
<author>Hadzilacos, V.</author>
<title>Issues of Fault Tolerance in Concurrent Computations.</title>
<genre>Ph.D. dissertation,</genre>
<publisher>Harvard University,</publisher>
<date>June 1984.</date>
</sequence>
<sequence>
<author>R. B. Kieburtz, B. Agapiev and J. Hook.</author>
<title>Three Monads for Continuations.</title>
<container-title>In Proceedings of the ACM SIGPLAN Workshop on Continuations,</container-title>
<publisher>Department of Computer Science, Stanford University,</publisher>
<genre>Report No. STAN-CS-92-1462,</genre>
<date>June 1992.</date>
</sequence>
<sequence>
<author>Y. Robert.</author>
<title>The Impact of Vector and Parallel Architectures on the Gaussian Elimination Algorithm.</title>
<publisher>Halsted Press,</publisher>
<location>New York,</location>
<date>1990.</date>
</sequence>
<sequence>
<author>Halpern, J. Y., &amp; Moses, Y.</author>
<date>(1990).</date>
<title>Knowledge and common knowledge in a distributed environment.</title>
<journal>Journal of the ACM,</journal>
<volume>37 (3),</volume>
<pages>549-587.</pages>
</sequence>
<sequence>
<author>Buntine, W.</author>
<date>(1994).</date>
<title>Operations for learning with graphical models.</title>
<journal>Journal of Artificial Intelligence Research,</journal>
<volume>2,</volume>
<pages>159-225.</pages>
</sequence>
<sequence>
<author>A. J. Bernstein.</author>
<title>Analysis of programs for parallel processing.</title>
<journal>IEEE Transactions on Electronic Computers,</journal>
<pages>pages 757-763,</pages>
<date>October 1966.</date>
</sequence>
<sequence>
<author>Debray, S. K. and Warren, D. S.,</author>
<title>Automatic Mode Inference for Logic Programs,</title>
<journal>J. Logic Programming,</journal>
<volume>5</volume>
<pages>207-229</pages>
<date>(1988).</date>
</sequence>
<sequence>
<author>Whittaker, J.</author>
<date>(1991).</date>
<title>Graphical Models in Applied Multivariate Statistics.</title>
<location>Chichester:</location>
<publisher>Wiley.</publisher>
</sequence>
<sequence>
<author>Henderson, D. A. Jr. And Card, S. K.</author>
<title>Rooms: The Use of Multiple Virtual Workspaces to Reduce Space Contention in a Window-Based Graphical User Interface,</title>
<journal>IEEE Transactions on Graphics,</journal>
<volume>5 (3),</volume>
<pages>211-243,</pages>
<date>1987.</date>
</sequence>
<sequence>
<author>Mooney, R. J., &amp; Califf, M. E.</author>
<date>(1995).</date>
<title>Induction of first-order decision lists: results on learning the past tense of english verbs.</title>
<journal>Journal of Artificial Intelligence Research,</journal>
<volume>3,</volume>
<pages>1-24.</pages>
</sequence>
<sequence>
<author>Hooman, J.,</author>
<title>"Specification and Compositional Verification of Real-Time Systems",</title>
<genre>PhD Thesis,</genre>
<location>Eindhoven, the Netherlands,</location>
<date>1991.</date>
</sequence>
<sequence>
<author>Hauptman, H., &amp; Karle, J.</author>
<date>(1953).</date>
<title>Solution of the Phase Problem, 1. The Centrosymmetric Crystal,</title>
<journal>ACA Monograph</journal>
<volume>No. 3.</volume>
<location>Wilmington:</location>
<publisher>Polycrystal Book Service.</publisher>
</sequence>
<sequence>
<author>D. A. Patterson and J. L. Hennessy.</author>
<title>Computer Architecture A Quantitative Approach,</title>
<pages>page 346.</pages>
<publisher>Morgan Kaufman Publishers Inc.,</publisher>
<location>San Mateo, California,</location>
<edition>second edition,</edition>
<date>1994.</date>
<note>Uncorrected preliminary manuscript.</note>
</sequence>
<sequence>
<author>Mooney, R. J.</author>
<date>(1990).</date>
<title>Learning plan schemata from observation: Explanation-based learning for plan recognition.</title>
<journal>Cognitive Science,</journal>
<volume>14,</volume>
<pages>483-509.</pages>
</sequence>
<sequence>
<author>S. Hiranandani, K. Kennedy, and C. Tseng.</author>
<title>Compiling Fortran D for MIMD distributed-memory machines.</title>
<journal>Communications of the ACM,</journal>
<volume>35(8)</volume>
<pages>66-80,</pages>
<date>Aug. 1992.</date>
</sequence>
<sequence>
<author>F. Rabiti, E. Brtino, W. Kim, D. Woelk,</author>
<title>A Model of Authorization for Next-Generation Database Systems,</title>
<note>to appear in ACM Transactions on Database Systems.</note>
</sequence>
<sequence>
<author>Crammond, J.,</author>
<title>Scheduling and Variable Assignment in the Parallel Parlog Implementation,</title>
<container-title>in Proceedings of the North American Conference on Logic Programming,</container-title>
<location>Austin,</location>
<publisher>MIT Press,</publisher>
<location>Cambridge, Mass.,</location>
<date>1990.</date>
</sequence>
<sequence>
<author>Aumann, R., &amp; Maschler, M.</author>
<date>(1995).</date>
<title>Repeated Games with Incomplete Information.</title>
<publisher>The MIT Press.</publisher>
</sequence>
<sequence>
<author>N. J. Nilsson.</author>
<title>Probabilistic logic.</title>
<journal>Artificial Intelligence,</journal>
<volume>28(1)</volume>
<pages>71-87,</pages>
<date>1986.</date>
</sequence>
<sequence>
<author>Neil Immerman</author>
<date>(1989),</date>
<title>Expressibility and Parallel Complexity,</title>
<journal>SIAM J. of Comput</journal>
<volume>18,</volume>
<pages>625-638.</pages>
</sequence>
<sequence>
<author>N. Benvenuto and F. Piazza.</author>
<title>On the Complex Backpropagation Algorithm.</title>
<journal>IEEE Transactions on Signal Processing,</journal>
<volume>40(4)</volume>
<pages>967-969,</pages>
<date>1992.</date>
</sequence>
<sequence>
<author>E. Granston and A. Veidenbaum.</author>
<title>Detecting redundant accesses to array data.</title>
<container-title>In Proceedings of Supercomputing '91,</container-title>
<location>Albuquerque, NM,</location>
<date>November 1991.</date>
</sequence>
<sequence>
<author>Guziec, A., &amp; Ayache, N.</author>
<date>(1992).</date>
<title>Smoothing and matching of 3-d space curves.</title>
<container-title>Visualization in Biomedical Computing, Proc. SPIE,</container-title>
<volume>1808,</volume>
<pages>259-273.</pages>
</sequence>
<sequence>
<author>P. Havlak and K. Kennedy.</author>
<title>An implementation of inter procedural bounded regular section analysis.</title>
<journal>IEEE Transactions on Parallel and Distributed Systems,</journal>
<volume>2(3)</volume>
<pages>350-360,</pages>
<date>July 1991.</date>
</sequence>
<sequence>
<author>Berlekamp, E.</author>
<title>Algebraic coding theory.</title>
<publisher>McGraw Hill,</publisher>
<location>New York NY,</location>
<date>1968.</date>
</sequence>
<sequence>
<author>Milner, R., M. Tofte, and R. Harper.</author>
<title>The Definition of Standard ML.</title>
<publisher>The MIT Press,</publisher>
<location>Cambridge, Massachusetts and London, England,</location>
<date>1990.</date>
</sequence>
<sequence>
<editor>Mark Keane, Padraig Cunningham, Mike Brady, and Ruth Byrne, editors.</editor>
<container-title>Proc. Seventh Irish Annual Conference of AI and Cognitive Science.</container-title>
<publisher>Dublin University Press,</publisher>
<date>1994.</date>
</sequence>
<sequence>
<author>Odlyzko, A.</author>
<title>Asymptotic enumeration methods.</title>
<container-title>In Handbook of Combinatorics,</container-title>
<editor>R. Graham, M. Grotschel, and L. Lovasz, Eds.,</editor>
<volume>vol. 2.</volume>
<publisher>Elsevier,</publisher>
<date>1995,</date>
<pages>pp. 1063-1229.</pages>
</sequence>
<sequence>
<author>K. Decker and V. Lesser,</author>
<title>"Designing a Family of Coordination Algorithms",</title>
<container-title>in the Proceedings of 13th International Distributed Artificial Intelligence Workshop,</container-title>
<location>Seattle, WA.,</location>
<date>July 1994.</date>
</sequence>
<sequence>
<author>J. Choi, R. Cytron, and J. Ferrante.</author>
<title>Automatic construction of sparse data flow evaluation graphs.</title>
<container-title>In Proceedings of the Eighteenth Annual ACM Symposium on the Principles of Programming Languages,</container-title>
<pages>pages 55-66,</pages>
<location>Orlando, FL,</location>
<date>January 1991.</date>
</sequence>
<sequence>
<editor>M. C. Ferris and J.-S. Pang (editors).</editor>
<title>Complementarity and variational problems : State of the Art.</title>
<publisher>SIAM Publications,</publisher>
<date>1997.</date>
</sequence>
<sequence>
<author>Bourdoncle, F.</author>
<title>Abstract debugging of higher-order imperative languages.</title>
<container-title>In ACM SIGPLAN Conference on Programming Language Design and Implementation,</container-title>
<pages>pages 46-55,</pages>
<date>1993.</date>
</sequence>
<sequence>
<author>D. Callahan, K. D. Cooper, K. Kennedy, and L. Torczon,</author>
<title>``Interprocedural constant propagation'',</title>
<container-title>Proc. SIGPLAN 86 Symposium on Compiler Construction, SIGPLAN Notices,</container-title>
<volume>21(7),</volume>
<date>July 1986.</date>
</sequence>
<sequence>
<author>Bengio, Y., &amp; Frasconi, P.</author>
<date>(1994).</date>
<title>Credit assignment through time: Alternatives to backpropagation.</title>
<editor>In Cowan, J. D., Tesauro, G., &amp; Alspector, J. (Eds.),</editor>
<container-title>Advances in Neural Information Processing Systems 6.</container-title>
<publisher>Morgan Kaufmann.</publisher>
</sequence>
<sequence>
<author>Bengio, Y., &amp; Frasconi, P.</author>
<date>(1995a).</date>
<title>Diffusion of credit in Markovian models.</title>
<editor>In Tesauro, G., Touretzky, D. S., &amp; Alspector, J. (Eds.),</editor>
<container-title>Advances in Neural Information Processing Systems 7.</container-title>
<publisher>MIT Press.</publisher>
</sequence>
<sequence>
<author>T. Carpenter, K. Driscoll, K. Hoyme, and J. Carciofini.</author>
<title>ARINC659 acheduling: Problem definition.</title>
<container-title>In Proceedings of the Real Time Systems Symposium,</container-title>
<pages>pages 165-169,</pages>
<date>December 1994.</date>
</sequence>
<sequence>
<author>M. J. Zekauskas, W. A. Sawdon, and B. N. Bershad.</author>
<title>Software write detection for distributed shared memory.</title>
<container-title>In Proceedings of the First USENIX Symposium on Operating System Design and Implementation,</container-title>
<pages>pages 87-100,</pages>
<date>November 1994.</date>
<pages>27</pages>
</sequence>
<sequence>
<author>Ware, C. &amp; Slipp, L.</author>
<date>(1991).</date>
<title>Using velocity control to navigate 3D graphical environments: a comparison of three interfaces.</title>
<container-title>Proceedings of the Human Factors Society 35th annual meeting.</container-title>
</sequence>
<sequence>
<author>David A. Wood, Satish Chandra, Babak Falsafi, Mark D. Hill, James R. Larus, Alvin R. Lebeck, James C. Lewis, Shubhendu S. Mukherjee, Subbarao Palacharla, and Steven K. Reinhardt.</author>
<title>Mechanisms for Cooperative Shared Memory.</title>
<container-title>In Proceedings of the 20th Annual International Symposium on Computer Architecture,</container-title>
<pages>pages 156-168,</pages>
<date>May 1993.</date>
</sequence>
<sequence>
<author>Morgenstern, L.</author>
<date>(1990).</date>
<title>A formal theory of multiple agent nonmonotonic reasoning.</title>
<container-title>In Proceedings of the Eighth National Conference on Artificial Intelligence,</container-title>
<pages>pp. 538-544</pages>
<location>Boston, Massachusetts.</location>
</sequence>
<sequence>
<author>Bergamaschi, S., &amp; Sartori, C.</author>
<date>(1992).</date>
<title>On taxonomic reasoning in conceptual design.</title>
<journal>ACM Transaction on Database Systems,</journal>
<volume>17 (3),</volume>
<pages>385-422.</pages>
</sequence>
<sequence>
<author>J. J. Koenderink.</author>
<title>The structure of images.</title>
<journal>Biological Cybernetics,</journal>
<volume>50</volume>
<pages>363-396,</pages>
<date>1984.</date>
</sequence>
<sequence>
<author>V. Guarna, D. Gannon, Y. Gaur, and D. Jablonowski.</author>
<title>Faust: An environment for programming parallel scientific applications.</title>
<container-title>In Proceedings of Supercomputing '88,</container-title>
<location>Orlando, FL,</location>
<date>November 1988.</date>
</sequence>
<sequence>
<author>Thrun, T., Schwartz, A.</author>
<date>(1995)</date>
<title>"Finding Structure in Reinforcement Learning,"</title>
<container-title>in Advances in Neural Information Processing Systems, 7.</container-title>
<location>San Mateo:</location>
<publisher>Morgan Kaufmann.</publisher>
</sequence>
<sequence>
<author>Rumelhart, D. E., Hinton, G. E., &amp; Williams, R. J.</author>
<date>(1986).</date>
<title>Learning internal representations by error propagation.</title>
<editor>In Rumelhart, D. E., McClelland, J. L., &amp; The PDP research group (Eds.),</editor>
<container-title>Parallel Distributed Processing,</container-title>
<volume>Vol. 1.,</volume>
<pages>pp. 318-362.</pages>
<publisher>MIT Press,</publisher>
<location>Cambridge, MA.</location>
</sequence>
<sequence>
<author>Tim Berners-Lee, Robert Cailliau, Jean-Francois Groff, and Bernd Pollermann.</author>
<title>WorldWideWeb: the information universe.</title>
<journal>Electronic Networking: Research, Applications and Policy,</journal>
<volume>2(1)</volume>
<pages>52-58,</pages>
<date>Spring 1992.</date>
</sequence>
<sequence>
<author>Georgeff, M. P.</author>
<date>(1987).</date>
<title>Actions, processes, and causality.</title>
<editor>In Georgeff, M. P., &amp; Lansky, A. L. (Eds.),</editor>
<container-title>Reasoning About Actions &amp; Plans,</container-title>
<pages>pp. 99-122.</pages>
<publisher>Morgan Kaufmann Publishers, Inc.,</publisher>
<location>Los Altos, California.</location>
</sequence>
<sequence>
<author>H. Johnson and P. Johnson,</author>
<title>Designers-identified requirements for tools to support task analyses,</title>
<container-title>INTERACT 90 Proceedings,</container-title>
<date>August 1990,</date>
<pages>pp. 259-264.</pages>
</sequence>
<sequence>
<author>Card, S. K., Mackinlay, J. D. and Robertson, G. G.</author>
<title>"The Design Space of Input Devices",</title>
<container-title>in Proceedings of CHI 90</container-title>
<location>(Seattle, Washington,</location>
<date>April 1-5, 1990).</date>
<publisher>ACM,</publisher>
<location>New York</location>
<date>1990,</date>
<pages>pp. 117-124.</pages>
</sequence>
<sequence>
<author>Brady, J. M., Agre, P. E., Braunegg, D. J., &amp; Connell, J. H.</author>
<date>(1984).</date>
<title>The mechanic's mate.</title>
<container-title>In Proceedings of the 1984 European Conference on Artificial Intelligence</container-title>
<location>Pisa, Italy.</location>
</sequence>
<sequence>
<author>J. K. Peir and R. Cytron.</author>
<title>Minimum distance a method for partitioning recur-resnces for multiprocessors.</title>
<container-title>In Proceedings of the 1987 International Conference on Parallel Processing,</container-title>
<pages>pages 217-224,</pages>
<date>1987.</date>
</sequence>
<sequence>
<author>Kambhampati, S., Knoblock, C., &amp; Yang, Q.</author>
<date>(1995).</date>
<title>Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning.</title>
<journal>Artificial Intelligence,</journal>
<volume>76,</volume>
<pages>167-238.</pages>
</sequence>
<sequence>
<author>W. W. Carlson and J. M. Draper.</author>
<title>AC for the T3D.</title>
<genre>Technical Report SRC-TR-95-141,</genre>
<publisher>Supercomputing Research Center,</publisher>
<location>Bowie, MD,</location>
<date>February 1995.</date>
</sequence>
<sequence>
<author>Rosenbloom, P. S., Laird, J. E., &amp; Newell, A.</author>
<date>(1988).</date>
<title>The chunking of skill and knowledge.</title>
</sequence>
<sequence>
<author>Genesereth, M., &amp; Nourbakhsh, I. R.</author>
<date>(1993).</date>
<title>Time Saving Tips for Problem Solving with Incomplete Information.</title>
<container-title>In Proceedings of AAAI-93.</container-title>
</sequence>
<sequence>
<author>Muggleton, S., &amp; De Raedt, L.</author>
<date>(1994).</date>
<title>Inductive logic programming: Theory and methods.</title>
<journal>Journal of Logic Programming,</journal>
<volume>19,</volume>
<pages>629-679.</pages>
</sequence>
<sequence>
<author>J. J Koenderink and A. J. van Doorn.</author>
<title>Representation of local geometry in the visual system.</title>
<journal>Biological Cybernetics,</journal>
<volume>55</volume>
<pages>367-375,</pages>
<date>1987.</date>
</sequence>
<sequence>
<author>R. Reiter.</author>
<title>A theory of diagnosis from first principles.</title>
<journal>Artificial Intelligence,</journal>
<volume>33(1)</volume>
<pages>57-95,</pages>
<date>1987.</date>
</sequence>
<sequence>
<author>J. T. Hecht, Y. Wang, B. Connor, S. H. Blanton, and S. P. Daiger.</author>
<title>Non-syndromic cleft lip and palate: No evidence of linkage to HLA or factor 13a.</title>
<journal>American Journal of Human Genetics,</journal>
<volume>52</volume>
<pages>1230-1233,</pages>
<date>1993.</date>
</sequence>
<sequence>
<author>Strang, G. and G. Fix,</author>
<title>A Fourier analysis of the finite element variational method, Constructive Aspects of Functional Analysis</title>
<editor>(G. Geymonat, ed.),</editor>
<journal>C. I. M. E.,</journal>
<date>1973,</date>
<pages>pp. 793-840.</pages>
</sequence>
<sequence>
<author>E. Berlekamp.</author>
<title>"Factoring polynomials over large finite fields,"</title>
<journal>Mathematics of Computation,</journal>
<volume>Vol. 24, No. 111,</volume>
<pages>pp. 713-735</pages>
<date>(1970).</date>
</sequence>
<sequence>
<author>J. Allen and J. Koomen.</author>
<title>Planning using a temporal world model.</title>
<container-title>In Proc. IJCAI,</container-title>
<pages>pages 741-747,</pages>
<date>1983.</date>
</sequence>
<sequence>
<author>D. Terzopoulos,</author>
<title>"Image Analysis using Multigrid Relaxation Methods,"</title>
<journal>IEEE Trans. Patt. Anal. Mach. Intell.,</journal>
<volume>Vol. 8,</volume>
<pages>pp. 129-139,</pages>
<date>March 1986.</date>
</sequence>
<sequence>
<author>Narendra, K., &amp; Thathachar, M. A. L.</author>
<date>(1989).</date>
<title>Learning Automata: An Introduction.</title>
<publisher>Prentice Hall.</publisher>
</sequence>
<sequence>
<author>J. Hafner and K. McCurley.</author>
<title>"On the distribution of running times of certain integer factoring algorithms,"</title>
<edition>preprint</edition>
<date>(1987).</date>
</sequence>
<sequence>
<editor>In Bouma, H., &amp; Elsendoorn, A. G. (Eds.),</editor>
<title>Working Models of Human Perception,</title>
<pages>pp. 391-410.</pages>
<publisher>Academic Press,</publisher>
<location>London, England.</location>
</sequence>
<sequence>
<author>J. Fortes and B. Wah,</author>
<title>Systolic Arrays | from Concept to Implementation,</title>
<journal>Computer</journal>
<volume>20</volume>
<date>(1987),</date>
</sequence>
<sequence>
<author>A. Borgida and T. Imielinski.</author>
<title>Decision making in committees-a framework for dealing with inconsistency and non-monotonicity.</title>
<container-title>In Proceedings Nonmono-tonic Reasoning Workshop,</container-title>
<pages>pages 21-32,</pages>
<date>1984.</date>
</sequence>
<sequence>
<author>De Schreye, D. and Martens, B.,</author>
<title>A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of Amalgamation,</title>
<editor>in: A. Pettorossi (ed.),</editor>
<container-title>Meta-Programming in Logic, LNCS 649,</container-title>
<publisher>Springer-Verlag,</publisher>
<location>Berlin,</location>
<date>1992.</date>
</sequence>
<sequence>
<author>Warren, D. H. D.</author>
<date>(1976).</date>
<title>Generating Conditional Plans and Programs.</title>
<container-title>In Proceedings of the Summer Conference on AI and Simulation of Behavior,</container-title>
<location>Edinburgh.</location>
</sequence>
<sequence>
<author>McDermott, J.</author>
<date>(1982).</date>
<title>R1: A rule-based configurer of computer systems.</title>
<journal>Artificial Intelligence,</journal>
<volume>19.</volume>
</sequence>
<sequence>
<author>Chapman, D.</author>
<date>(1987).</date>
<title>Planning for conjunctive goals.</title>
<journal>Artificial Intelligence,</journal>
<volume>32,</volume>
<pages>333-377.</pages>
</sequence>
<sequence>
<author>Thomas von Eicken, David E. Culler, Seth Copen Goldstein, and Karl Erik Schauser.</author>
<title>Active messages: A mechanism for integrated communication and computation.</title>
<container-title>In Proceedings of the 19th Annual International Symposium on Computer Architecture,</container-title>
<pages>pages 256-266,</pages>
<date>May 1992.</date>
</sequence>
<sequence>
<author>K. Li and P. Hudak.</author>
<title>Memory coherence in shared virtual memory systems.</title>
<journal>ACM Transactions on Computer Systems,</journal>
<volume>7(4)</volume>
<pages>321-359,</pages>
<date>November 1989.</date>
</sequence>
<sequence>
<author>Quinlan, J. R., &amp; Cameron-Jones, R. M.</author>
<date>(1993).</date>
<title>FOIL: A midterm report.</title>
<container-title>In Proceedings of the European Conference on Machine Learning,</container-title>
<pages>pp. 3-20</pages>
<location>Vienna.</location>
</sequence>
<sequence>
<author>Asahiro, Y., Iwama, K., &amp; Miyano, E.</author>
<date>(1993).</date>
<title>Random generation of test instances with controlled attributes.</title>
<container-title>In Second DIMACS Challenge Workshop.</container-title>
</sequence>
<sequence>
<author>Leroy, X.</author>
<title>The Objective Caml system, documentation and user's guide,</title>
<date>1997.</date>
</sequence>
<sequence>
<author>Thomas F. LaPorta and Mischa Schwartz.</author>
<title>Performance analysis of MSP: Feature-rich high-speed transport protocol.</title>
<journal>IEEE/ACM Transactions on Networking,</journal>
<volume>1(6)</volume>
<pages>740-753,</pages>
<date>December 1993.</date>
</sequence>
<sequence>
<author>U. Kremer, H. Zima, H.-J. Bast, and M. Gerndt.</author>
<title>Advanced tools and techniques for automatic parallelization.</title>
<journal>Parallel Computing,</journal>
<volume>7</volume>
<pages>387-393,</pages>
<date>1988.</date>
</sequence>
<sequence>
<author>J. S. Huang and Y. C. Chow.</author>
<title>Parallel Sorting and Data Partitioning by Sampling.</title>
<container-title>In Proceedings of the 7th Computer Software and Applications Conference,</container-title>
<pages>pages 627-631,</pages>
<date>November 1983.</date>
</sequence>
<sequence>
<author>Hume, D., &amp; Sammut, C.</author>
<date>(1991).</date>
<title>Using inverse resolution to learn relations from experiments.</title>
<container-title>In Proceedings of the Eighth International Workshop on Machine Learning.</container-title>
<publisher>Morgan Kaufmann.</publisher>
</sequence>
<sequence>
<author>Baral, C., &amp; Subrahmanian, V.</author>
<date>(1991).</date>
<title>Duality between alternative semantics of logic programs and nonmonotonic formalisms.</title>
<container-title>In Proc. Intl. Workshop on Logic Programming and Nonmonotonic Reasoning.</container-title>
<publisher>Springer.</publisher>
</sequence>
<sequence>
<author>M. Galles and E. Williams.</author>
<title>Performance optimizations, implementation, and verification of the SGI Challenge multiprocessor.</title>
<container-title>In Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences, volume I: Architecture,</container-title>
<pages>pages 134-143,</pages>
<date>January 1994.</date>
</sequence>
<sequence>
<author>Deerwester, S., Dumais, S., Furnas, G., Landauer, T., &amp; Harshman, R.</author>
<date>(1990).</date>
<title>Indexing by latent semantic analysis.</title>
<journal>Journal of the American Society for Information Science,</journal>
<volume>41,</volume>
<pages>391-407.</pages>
</sequence>
<sequence>
<author>Geddes, K., Czapor, S., and Labahn, G.</author>
<title>Algorithms for Computer Algebra.</title>
<publisher>Kluwer Academic Publishers,</publisher>
<location>Boston,</location>
<date>1992.</date>
</sequence>
<sequence>
<author>Warren R. Greiff.</author>
<title>Computationally tractable, conceptually plausible classes of link matrices for the inquery inference network.</title>
<genre>Technical Report CmpSci TR-96-66,</genre>
<publisher>University of Massachusetts,</publisher>
<location>Amherst, Massachusetts,</location>
<date>September 1996.</date>
</sequence>
<sequence>
<author>Puterman, M. L.</author>
<date>(1994).</date>
<title>Markov Decision Problems.</title>
<publisher>Wiley,</publisher>
<location>New York.</location>
</sequence>
<sequence>
<author>Hel-Or, Y., &amp; Werman, M.</author>
<date>(1992).</date>
<title>Absolute orientation from uncertain data: A unified approach.</title>
<container-title>In Proc. Intern. Conference on Computer Vision and Pattern Recognition,</container-title>
<pages>pp. 77-82.</pages>
</sequence>
<sequence>
<author>Foley, J. D., van Dam, A., Feiner, S. K., Hughes, J. F.,</author>
<title>Computer Graphics: Principles and Practice,</title>
<pages>pp. 992-996,</pages>
<publisher>Addison-Wesley,</publisher>
<location>Massachusetts</location>
<date>1990.</date>
</sequence>
<sequence>
<author>A. V. Aho, J. E. Hopcroft, and J. D. Ullman,</author>
<title>The Design and Analysis of Computer Algorithms,</title>
<publisher>Addison-Wesley,</publisher>
<location>Reading, MA,</location>
<date>1974.</date>
</sequence>
<sequence>
<author>Panario, D., Gourdon, X., and Flajolet, P.</author>
<title>An analytic approach to smooth polynomials.</title>
<note>Submitted,</note>
<date>1998.</date>
</sequence>
<sequence>
<author>J. McCarthy.</author>
<title>Circumscription a form of non-monotonic reasoning.</title>
<journal>Artificial Intelligence,</journal>
<volume>13</volume>
<pages>27-39, 171-172,</pages>
<date>1980.</date>
</sequence>
<sequence>
<author>Kerber, R.</author>
<date>(2007).</date>
<title>Cost of data breach at TJX soars to $256 m.</title>
<journal>Boston Globe,</journal>
<url>http://www. boston.com/business/globe/articles/2007/08/15/cost_of_data_breach_at_tjx_soars_to_256m.</url>
</sequence>
<sequence>
<author>O. Shechory and S. Kraus.</author>
<title>Feasible formation of stable coalitions among autonomous agents in general environments.</title>
<journal>Computational Intelligence Journal,</journal>
<date>1995.</date>
<note>Submitted.</note>
</sequence>
<sequence>
<author>R. R. Jueneman, S. M. Matyas, and C. H. Meyer,</author>
<title>``Message Authentication,''</title>
<journal>IEEE Communications</journal>
<volume>23(9),</volume>
<pages>pp. 29-40</pages>
<date>(September 1985).</date>
</sequence>
<sequence>
<author>Korf, R.</author>
<date>(1985).</date>
<title>Macro-operators: a weak method for learning.</title>
<journal>Artificial Intelligence,</journal>
<volume>26,</volume>
<pages>35-77.</pages>
</sequence>
<sequence>
<author>Michalski, R. S.</author>
<date>(1983).</date>
<title>"A theory and methodology of inductive learning".</title>
<editor>In Michalski, R. S., Carbonell, J. G., &amp; Mitchell, T. M. (Eds.),</editor>
<container-title>Machine Learning: An Artificial Intelligence Approach.</container-title>
<publisher>Tioga Publishing Company,</publisher>
<location>Palo Alto, CA.</location>
</sequence>
<sequence>
<author>R. Gupta,</author>
<title>"Optimizing Array Bound Checks using Flow Analysis,"</title>
<journal>ACM Letters on Programming Languages and Systems,</journal>
<volume>Vol. 2, Nos. 1-4,</volume>
<pages>pages 135-150,</pages>
<date>March - December 1994.</date>
</sequence>
<sequence>
<author>Sun Microsystems.</author>
<title>Java (tm): Programming for the Internet.</title>
<url>http://java.sun.com.</url>
</sequence>
<sequence>
<author>Golomb, S., &amp; Baumert, L.</author>
<date>(1965).</date>
<title>Backtrack programming.</title>
<journal>J. ACM,</journal>
<volume>12,</volume>
<pages>516-524.</pages>
</sequence>
<sequence>
<author>MacWhinney, B.</author>
<date>(1990).</date>
<title>The CHILDES Project: Tools for Analyzing Talk.</title>
<location>Hillsdale, NJ:</location>
<publisher>Erlbaum.</publisher>
</sequence>
<sequence>
<author>L. Sha, R. Rajkumar, and J. Lehoczky,</author>
<title>"Priority Inheritance Protocols: An Approach to RealTime System Synchronization",</title>
<journal>IEEE Transactions on Computers,</journal>
<volume>Vol. 39, No. 9,</volume>
<date>1990,</date>
<pages>pp. 1175-1185.</pages>
</sequence>
<sequence>
<author>P. Keleher, S. Dwarkadas, A. Cox, and W. Zwaenepoel.</author>
<title>Treadmarks: Distributed shared memory on standard workstations and operating systems.</title>
<container-title>In Proc. 1994 Winter USENIX Conference,</container-title>
<pages>pages 115-131,</pages>
<date>1994.</date>
</sequence>
<sequence>
<author>De Raedt, L., Lavrac, N., &amp; Dzeroski, S.</author>
<date>(1993).</date>
<title>Multiple predicate learning.</title>
<container-title>In Proceedings of the Third International Workshop on Inductive Logic Programming</container-title>
<location>Bled, Slovenia.</location>
</sequence>
<sequence>
<author>Whitley, D., &amp; Gruau, F.</author>
<date>(1993).</date>
<title>Adding learning to the cellular development of neural networks: Evolution and the Baldwin effect.</title>
<journal>Evolutionary Computation,</journal>
<volume>1,</volume>
<pages>213-233.</pages>
</sequence>
<sequence>
<author>Wellman, M.</author>
<date>(1985).</date>
<title>Reasoning about preference models.</title>
<genre>Tech. rep. MIT/LCS/TR-340,</genre>
<publisher>Laboratory for Computer Science, MIT.</publisher>
</sequence>
<sequence>
<author>Soskin, William F.</author>
<date>(1963).</date>
<title>Verbal Interactions in a Young Married Couple.</title>
<publisher>University of Kansas Publications,</publisher>
<location>Lawrence, Kansas.</location>
</sequence>
<sequence>
<author>T. E. Hull and M. S. Cohen.</author>
<title>Toward an ideal computer arithmetic.</title>
<editor>In M. J. Irwin and R. Stafanelli, editors,</editor>
<container-title>Proceedings of the 8th Symposium on Computer Arithmetic,</container-title>
<pages>pages 131-138.</pages>
<publisher>IEEE Computer Society,</publisher>
<location>Los Angeles,</location>
<date>1987.</date>
</sequence>
<sequence>
<author>Grosz, B. J., and Sidner, C. L.</author>
<date>1986.</date>
<title>Attention, intention, and the structure of discourse.</title>
<journal>Computational Linguistics</journal>
<volume>12(3)</volume>
<pages>175-204</pages>
</sequence>
<sequence>
<author>Wilke, W.</author>
<date>(1993).</date>
<title>Entwurf und Implementierung eines Algorithmus zum wissensintensiven Lernen von Planabstraktionen nach der PABS-Methode.</title>
<genre>Projektarbeit,</genre>
<publisher>Universitat Kaiserslautern.</publisher>
</sequence>
<sequence>
<author>J. M. Ponte and W. B. Croft,</author>
<title>Text Segmentation by Topic,</title>
<container-title>in Proceedings of the First European Conference on Research and Advanced Technology for Digitial Libraries,</container-title>
<pages>pp. 120-129,</pages>
<date>1997.</date>
</sequence>
<sequence>
<author>McCarthy, J. F., &amp; Lehnert, W. G.</author>
<date>(1995).</date>
<title>Using decision trees for coreference resolution.</title>
<container-title>In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI).</container-title>
</sequence>
<sequence>
<author>Dario Giarrizzo, Matthias Kaiserswerth, Thomas Wicki, and Robin C. Williamson.</author