Kendall E. Nygard
- 1.Anderson-Bell Corp. (1988). ABsmt User'x Guide. i 1479 S. Pine Dr. Parker, CO 80134.]]Google Scholar
- 2.Berry, D.A. and B.W. Lindgren. (1990). $ta~tics: Theory and Methods. Brooks/Cole, California.]]Google Scholar
- 3.Bratcher, T.L., M.A. Moran, and W.J. Zimmer. (1970). Tables of Sample Size in Analysis of Variance, Journal of Quality Technology, Vo!. 2, No. 3, 156-164.]]Google ScholarCross Ref
- 4.Clarke, G. and j.W. Wright. (1964). Scheduling of Vehicles from n Central Depot to a Number of Delivery Points, Operations Research 12, 568-581.]]Google ScholarDigital Library
- 5.Computing Resource Center. (1984). Statistics/Data Analysis User's Guide. 10801 National Boulevard Los Angeles, CA 9(}064.]]Google Scholar
- 6.Conover, W.J. (1980). Practical Nonparametric Statistics, 2nd ed. John Wiley and Sons, New York.]]Google Scholar
- 7.Fisher, M. and R. Jaikumar. (1981). A Generalized Assignment Heuristics for Vehicle Routing, Networks 11, 109- 124.]]Google ScholarCross Ref
- 8.Golden, B.L and W.R. Stewart. (1985). Emp'mcal Analysis of Heuristics, in The TraveUng Salesroom Problem, E. Lawler, J. Lenstra, A. Rinnooy Kan, nnd D. Shmoys, eds. John Wiley and Sons, New York, 207-249.]]Google Scholar
- 9.Ke~ncy, R.L. and H. Raiffa. (1976). Decisions with Muln~le Objectives: Preferences and Value Tradeo.~, John Wiley and Sons, New York.]]Google Scholar
- 10.Lenstr~ J. and A. Rinnooy Kan. (1981). Complexity of Vehicle Routing and Scheduling Problems, Networks 1 I, 221- 22'/.]]Google Scholar
- 11.Makridakis, S., R.L. Winkler, and D.M. Harde. (1988). ISP User's Guide, Lincoln Systems Corporation, Westford, MA 01886.]]Google Scholar
- 12.Miller, L.H. (1965). Table of Percentage Points of Kolmogomv Statistics, J. Amer. Statist, Assoc., 51, 111-121.]]Google Scholar
- 13.Montgomery, D.C. (1984). Design and Analysis of Experiments, 2nd ed. John Wiley and Sons, New York.]] Google ScholarDigital Library
- 14.Nelson, M.D. (1983). Implementation Techniques for the Vehicle Routing Problem, M.S. Thesis, Depatuncnt of Computer Science, North Dakota State University.]]Google Scholar
- 15.Neter, J., W. Wa.s,~rman, and M.H. Kutner. (1985). Applied Linear Statistical Models, 2nd ed. RICHARD D. IRWIN, illinois.]]Google Scholar
- 16.Nygard, K.E., P. Juell, and K. Nagesh. (1989). An interactive Decision Support System for Vehicle Routing, in Iml~t of Recent Computer Advances on Operations Research, Ramcsh Sharda, Bruce Golden, Edward Wasil, Osman Balci, and William Stewart, Eds., Elsevier Science, New York, 361-372.]]Google Scholar
- 17.Nygard, K.E. and R. Walker. (1988). A Vehicle Routing Algorithms Based on Spacefilling Curves, Technical Report, Department of Computer Science and Operations Research, North Dakota State University.]]Google Scholar
- 18.Shapiro, S.S. and M.B. Wile (1965). An Analysis of Variance Test for Normality (Complete Samples), Biometrika 52, 3 and 4, 59 I-611.]]Google Scholar
- 19.Solomon, M.M. (1983). Vehicle Routing and Scheduling with Tune Window Comtraints: Models and Algorithms, Working Paper:. 83-42, Northeastern University.]]Google Scholar
- 20.Sun Microsystema, Inc. (1986). $unView Programmer's Guide, 2550 Oarcia Ave Mountain View, CA 94043.]]Google Scholar
- 21.Tiku, M.L. (1965). Laguerre Series Forms of Non-central X2 and F Distributions, Biometrika 52, 415-427.]]Google Scholar
- 22.T'tku, M.L. (1967). Tables of the Power of the F-Test, )oumal of the American Sta~ Association, Vol. 62, No. 318, 525-539.]]Google Scholar
- 23.Walpole, R.E. and R.H. Myers. (1989). Probability and Statistics for Engineers and Scientittt, 4th ed., MacMillan, New York.]]Google Scholar
Index Terms
- Conversational statistical comparison of routing algorithms
Recommendations
Performance Comparison of Geographic DTN Routing Algorithms
COMPSAC '15: Proceedings of the 2015 IEEE 39th Annual Computer Software and Applications Conference - Volume 03In this paper, we compare the performances of geographic DTN (Delay/Disruption-Tolerant Network) routing algorithms through simulation experiments. We compare message delivery times in five geographic DTN routing algorithms--Random, Nearest, Farthest, ...
Conversational Agents: Acting on the Wave of Research and Development
CHI EA '19: Extended Abstracts of the 2019 CHI Conference on Human Factors in Computing SystemsIn the last five years, work on software that interacts with people via typed or spoken natural language, called chatbots, intelligent assistants, social bots, virtual companions, non-human players, and so on, increased dramatically. Chatbots burst into ...
Performance comparison of routing protocols using MaRS: distance-vector versus link-state
SIGMETRICS '92/PERFORMANCE '92: Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systemsThere are two approaches to adaptive routing protocols for wide-area store-and-forward networks: distance-vector and link-state. Distance-vector algorithms use O(N x e) storage at each node, whereas link-state algorithms use O(N2), where N is the number ...
Comments