Browse

ftp://ftp.cs.yale.edu (34)

	ftp://ftp.cs.yale.edu/pub/TR/tr875.ps.gz, 19911105 Yale University Department of Computer Science Decision Making in the Presence of Noise Michael J. Fischer Sophia A. Paleologou YALEU/DCS/TR-875 October 1991 This research was supported in part by National Science Foundation grant IRI{9015570. Decision Making in the Presence of Noise Michael J. Fischer
	ftp://ftp.cs.yale.edu/pub/TR/tr928.ps.gz, 19921104 Yale University Department of Computer Science Ars Magna The Abstract Robot Simulator Manual Version 1.0 Sean P. Engelson Niklas Bertani YALEU/DCS/TR-XXX October 1992 This work was partially supported by the Defense Advanced Research Projects Agency, contract number DAAA15-87-K-0001, administered by the
	ftp://ftp.cs.yale.edu/pub/TR/tr941.ps.gz, 19930402 TRANSFORMATIONAL PLANNING OF REACTIVE BEHAVIOR Drew McDermott YALEU/CSD/RR #941 December, 1992 This work was supported by the Defense Advanced Research Projects Agency, contract number N00014-91-J-1577, administered by the Office of Naval Research. Transformational Planning of Reactive Behavior Drew
	ftp://ftp.cs.yale.edu/pub/TR/tr882.ps.gz, 19930415 Optimizing FORTRAN-90 Programs for Data Motion on Massively Parallel Systems * Draft * Marina C. Chen Jan-Jan Wu1 chen-marina@cs.yale.edu wu-jan-jan@cs.yale.edu Department of Computer Science Yale University New Haven, CT 06520-2158
	ftp://ftp.cs.yale.edu/pub/TR/tr864.ps.gz, 19930426 A Reactive Plan Language Drew McDermott 1 Overview RPL (Reactive Plan Language)1 belongs to the family of notations for writing reactive plans for agents (e.g., robots) (Davis 1984, Ingrand and Georgeff 1990, Lyons 1990a,b, Gat 1991). Its immediate ancestor is Firby's (1987, 1989) RAP notation. Many of
	ftp://ftp.cs.yale.edu/pub/TR/tr936.ps.gz, 19940311 Yale University Department of Computer Science Inductive Inference of Total Recursive Functions by Probabilistic and Deterministic Strategies Martinch Krikis Rusins Freivalds YALEU/DCS/TR-936 November 1992 Preparation and distribution of this work was supported by NSF grant CCR-9014943 Inductive
	ftp://ftp.cs.yale.edu/pub/TR/tr1020.ps.gz, 19940311 Yale University Department of Computer Science Exact Learning of -DNF Formulas with Malicious Membership Queries Dana Angluin YALEU/DCS/TR-1020 March 1994 This research was supported by the National Science Foundation, grant CCR-9213881. Exact Learning of -DNF Formulas with Malicious Membership Queries
	ftp://ftp.cs.yale.edu/pub/TR/tr1019.ps.gz, 19940311 Yale University Department of Computer Science Malicious Membership Queries and Exceptions Dana Angluin Martinch Krikis YALEU/DCS/TR-1019 March 1994 This research was supported by the National Science Foundation, grant CCR-9213881. Malicious Membership Queries and Exceptions Dana Angluin M arti n<=s Kri
	ftp://ftp.cs.yale.edu/pub/TR/tr1014.ps.gz, 19940318 An Algorithm for Probabilistic, Totally-Ordered Temporal Projection Drew McDermott March 15, 1994
	ftp://ftp.cs.yale.edu/pub/TR/main.ps, 19940518 Passive Map Learning and Visual Place Recognition Sean Philip Engelson YALEU/CSD/RR #1032 May 1994
	ftp://ftp.cs.yale.edu/pub/TR/tr897.ps.gz, 19940926 Page Migration Algorithms Using Work Functions Marek Chrobak Lawrence L. Larmorey Nick Reingoldz Jeffery Westbrook x September 26, 1994
	ftp://ftp.cs.yale.edu/pub/TR/tr844.ps.gz, 19940926 RANDOMIZED ALGORITHMS FOR MULTIPROCESSOR PAGE MIGRATION JEFFERY WESTBROOK
	ftp://ftp.cs.yale.edu/pub/TR/tr1013.ps.gz, 19940926 Yale University Department of Computer Science Adaptive Algorithms for PASO Systems Jeffery Westbrook Lenore Zuck Department of Computer Science Yale University New Haven, CT 06520 YALEU/DCS/TR-1013 September 1994 Adaptive Algorithms for PASO Systems1
	ftp://ftp.cs.yale.edu/pub/TR/tr999.ps.gz, 19940926 Yale University Department of Computer Science Load Balancing for Response Time Jeffery Westbrook1 YALEU/DCS/TR-999 September 1994 1Department of Computer Science, Yale University, New Haven, CT 06520. Email: westbrook@cs.yale.edu.
	ftp://ftp.cs.yale.edu/pub/TR/tr1056.ps.gz, 19950308 Yale University Department of Computer Science Dynamic Fault Diagnosis William Hurwood YALEU/DCS/TR-1056 December 1994
	ftp://ftp.cs.yale.edu/pub/TR/tr1059.ps.gz, 19951106 Keeping One's Eye on the Ball: Tracking Occluding Contours of Unfamiliar Objects without Distraction Kentaro Toyama and Gregory D. Hager Department of Computer Science Yale University December 6, 1994
	ftp://ftp.cs.yale.edu/pub/TR/tr1032.ps.gz, 19951109 Passive Map Learning and Visual Place Recognition Sean Philip Engelson YALEU/CSD/RR #1032 May 1994
	ftp://ftp.cs.yale.edu/pub/TR/tr1062.ps.gz, 19951114 A graduated assignment algorithm for graph matching Steven Gold and Anand Rangarajan Department of Computer Science, and Yale Center for Theoretical and Applied Neuroscience (CTAN) Yale University
	ftp://ftp.cs.yale.edu/pub/TR/tr1094.ps.gz, 19960105 Meta Information in Visual Programming Elisabeth Freeman David Gelernter Yale University Yale University New Haven, CT 06520 New Haven, CT 06520
	ftp://ftp.cs.yale.edu/pub/TR/tr1058.ps.gz, 19960315 111 M. Naor, A. Orlitsky, and P. Shor. Three results on interactive communication. IEEE Trans. Information Theory, 39(5):1608615, September 1993. A. Orlitsky. Worst-case interactive communication I: Two messages are almost optimal. IEEE Trans. Information Theory, 36(5):1111126,
	ftp://ftp.cs.yale.edu/pub/TR/tr1069.ps.gz, 19960327 Yale University Department of Computer Science A Type-Based Compiler for Standard ML Zhong Shao Andrew W. Appel Yale University Princeton University YALEU/DCS/TR-1069 March 31, 1995 A Type-Based Compiler for Standard ML Zhong Shao Andrew W. Appely Yale University Princeton University Technical Report
	ftp://ftp.cs.yale.edu/pub/TR/tr1082.ps.gz, 19960328 A novel optimizing network architecture with applications Anand Rangarajan1, Steven Gold1 and Eric Mjolsness2 Department of Computer Science Yale University 51 Prospect Street New Haven, CT 06520-8285
	ftp://ftp.cs.yale.edu/pub/TR/tr1092.ps.gz, 19960403 RANDOM WALKS AND AN O (n5) VOLUME ALGORITHM FOR CONVEX BODIES Ravi Kannan1 L aszl o Lov asz2 Mikl os Simonovits3 Technical Report No. 1092 Department of Computer Science Yale University January 1996 4
	ftp://ftp.cs.yale.edu/pub/TR/tr1099.ps.gz, 19960403 Reversal of Markov Chains and the Forget Time L aszl o Lov asz1 and Peter Winkler2 Technical Report No. 1099 Department of Computer Science Yale University (March 1996)
	ftp://ftp.cs.yale.edu/pub/TR/tr1100.ps.gz, 19960403 Mixing Times for Uniformly Ergodic Markov Chains David Aldous1 and L aszl o Lov asz2 and Peter Winkler3
	ftp://ftp.cs.yale.edu/pub/TR/tr1101.ps.gz, 19960422 The membership problem in jump systems L aszl o Lov asz Dept. of Computer Science, Yale University, New Haven, CT 06510 Technical Report No. 1101 Department of Computer Science Yale University November 1995
	ftp://ftp.cs.yale.edu/pub/TR/tr1086.ps.gz, 19960422 CONVEX HULLS OF f- AND -VECTORS DMITRY N. KOZLOV
	ftp://ftp.cs.yale.edu/pub/TR/tr1087.ps.gz, 19960422 COINS AND CONES DMITRY N. KOZLOV AND VAN H. VU
	ftp://ftp.cs.yale.edu/pub/TR/tr1104.ps.gz, 19960426 Yale University Department of Computer Science Lectures on Network Complexity presented by Prof. Michael J. Fischer at the University of Frankfurt YALEU/DCS/TR-1104 June 1974 Revised April 1977, April 1996 This research was supported in part by the National Science Foundation under research grant
	ftp://ftp.cs.yale.edu/pub/TR/tr1080.ps.gz, 19960522 Yale University Department of Computer Science Closure Properties of GapP and #P Richard Beigel Yale University YALEU/DCS/TR-1080 June 28, 1995 Closure Properties of GapP and #P Richard Beigel Yale University
	ftp://ftp.cs.yale.edu/pub/TR/tr1065.ps.gz, 19960913 Yale University Department of Computer Science Faster Schedules for Diffusive Load Balancing via Over{Relaxation (***DRAFT. DO NOT DISTRIBUTE***) Bhaskar Ghosh 1 S. Muthukrishnan 2 Martin H. Schultz 3 YALEU/DCS/TR-YALEU/DCS/TR-1065 February 1995 1Department of Computer Science, Yale University.
	ftp://ftp.cs.yale.edu/pub/TR/tr1053.ps.gz, 19960913 Yale University Department of Computer Science Dynamic Load Balancing with Limited Link Capacities Bhaskar Ghosh 1 S. Muthukrishnan 2 YALEU/DCS/TR-YALEU/DCS/TR-1053 November 1994 1Department of Computer Science, Yale University. P.O.Box 208285, New Haven, CT 06520. Supported by ONR under grant number
	ftp://ftp.cs.yale.edu/pub/TR/tr1064.ps.gz, 19960913 TIGHT ANALYSES OF TWO LOCAL LOAD BALANCING ALGORITHMS BHASKAR GHOSH 1 F. T. LEIGHTON 2 BRUCE M. MAGGS 3;4 S. MUTHUKRISHNAN 5 C. GREG PLAXTON 6;7 R. RAJARAMAN 6;7 ANDR EA W. RICHA 3 ROBERT E. TARJAN 8 DAVID ZUCKERMAN 6;9
	ftp://ftp.cs.yale.edu/pub/TR/tr1116.ps.gz, 19961119 Yale University Department of Computer Science Molecular Computing, Bounded Nondeterminism, and Efficient Recursion Richard Beigel Bin Fu Yale University and University of Maryland YALEU/DCS/TR-1116 November 1996 Molecular Computing, Bounded Nondeterminism, and Efficient Recursion Richard Beigely Bin