-
Notifications
You must be signed in to change notification settings - Fork 103
Expand file tree
/
Copy pathcore.xml
More file actions
11887 lines (11887 loc) · 472 KB
/
Copy pathcore.xml
File metadata and controls
11887 lines (11887 loc) · 472 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<?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., & 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., & 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., & 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., & 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., & 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., & 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 & 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., & 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., & 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., & 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., & 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., & 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&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. & 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., & 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., & 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., & 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., & 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., & 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., & 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&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., & 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., & 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., & 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., & 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., & 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., & 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., & Hollan, J. D.,</author>
<title>Pad++: A zooming graphical interface for exploring alternate interface physics,</title>