"Knearest neighbor algorithm" Essays and Research Papers

Sort By:
Satisfactory Essays
Good Essays
Better Essays
Powerful Essays
Best Essays
Page 43 of 50 - About 500 Essays
  • Powerful Essays

    using Mobile Ad-hoc Networks (MANETs) for rural public safety. First‚ we discuss a QoS enhancement to a standard routing protocol‚ Dynamic Source Routing (DSR). By incorporating a new routing metric and the available bandwidth and delay estimation algorithms with DSR‚ we design a new routing protocol‚ QoSAware Source Routing (QASR)‚ to meet the QoS requirements specified by Statement of Requirements (SoR) for public safety communications. We then evaluate the performance of QASR and the well-known standard

    Premium Routing protocol Routing

    • 4518 Words
    • 27 Pages
    Powerful Essays
  • Good Essays

    Operating System Concepts

    • 21171 Words
    • 85 Pages

    STUDENT’S MANUAL TO ACCOMPANY OPERATING SYSTEM CONCEPTS SEVENTH EDITION ABRAHAM SILBERSCHATZ Yale University PETER BAER GALVIN Corporate Technologies GREG GAGNE Westminster College Preface This volume is a student’s manual for the Seventh Edition of Operating System Concepts‚ by Abraham Silberschatz‚ Peter Baer Galvin‚ and Greg Gagne. It consists of answers to the exercises in the parent text. Although we have tried to produce a student’s manual that will aid all of the users

    Premium Operating system

    • 21171 Words
    • 85 Pages
    Good Essays
  • Satisfactory Essays

    Survivability In Healthcare

    • 19783 Words
    • 80 Pages

    Carnegie Mellon University Survivability Requirements for the U.S. Health Care Industry A Thesis Submitted to the Information Networking Institute in Partial Fulfillment of the Requirements for the degree MASTER OF SCIENCE in INFORMATION NETWORKING by Jose Caldera Pittsburgh‚ Pennsylvania May 2000 Copyright by Jose Caldera‚ 2000. All rights reserved - Carnegie Mellon University Information Networking Institute THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE

    Premium Health care Medicine Health insurance

    • 19783 Words
    • 80 Pages
    Satisfactory Essays
  • Powerful Essays

    artifical intelligence

    • 6803 Words
    • 23 Pages

    INTRODUCTION Artificial intelligence (AI) is the intelligence exhibited by machines or software. It is also an academic field of study. Major AI researchers and textbooks define the field as "the study and design of intelligent agents"‚ where an intelligent agent is a system that perceives its environment and takes actions that maximize its chances of success. John McCarthy‚ who coined the term in 1955‚ defines it as "the science and engineering of making intelligent machines". AI research is highly

    Premium Artificial intelligence

    • 6803 Words
    • 23 Pages
    Powerful Essays
  • Powerful Essays

    3.2.2. Computation of Current Trust Let TV(t) represents for a requested node’s historical trust level at the end of time interval t‚ and C(t + 1) represents for this node’s capability level on providing service for the next time interval t + 1 (prediction time interval)‚ which includes the remnant utilization ratio of battery‚ local memory‚ CPU cycle‚ and bandwidth at that point. Let TV(t + 1) refers to the same node’s current trust level for the next time interval t + 1. Assume the fuzzy membership

    Premium Project management Management Critical path method

    • 1636 Words
    • 7 Pages
    Powerful Essays
  • Powerful Essays

    Michael J. Mcglynn and Steven A. Borbash. Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks. In MobiHoc 01: Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking and computing‚ pages 137-145‚ New York‚ NY‚ USA‚ 2001. ACM. [4] Martin Kubisch‚ Hogan Karl‚ Adam Wolisz‚ Lizhi Charlie Zhong‚ Jan Rabaey. ”Distributed Algorithms for Transmission Power Control in Wireless Sensor Networks”. Proceedings WCNS03‚ IEEE Wireless Communications

    Premium Network topology Wireless networking Wireless

    • 8230 Words
    • 33 Pages
    Powerful Essays
  • Good Essays

    data communications

    • 17792 Words
    • 115 Pages

    CHAPTER 12 ROUTING IN SWITCHED NETWORKS A NSWERS TO Q UESTIONS 12.1 The average load expected over the course of the busiest hour of use during the course of a day. 12.2 The tradeoff is between efficiency and resilience. 12.3 A static routing strategy does not adapt to changing conditions on the network but uses a fixed strategy developed ahead of time. With alternate routing‚ there are a number of alternate routes between source and destination and a dynamic choice of routes is

    Premium Ethernet Computer networking Computer network

    • 17792 Words
    • 115 Pages
    Good Essays
  • Good Essays

    Networking

    • 4941 Words
    • 20 Pages

    Phase 1: Identifying Requirements‚ Putting the Network Together Scenario NuggetLabs Industries is growing significantly. Due to space limitations‚ five employees currently share single cubicles…at the same time. While this is great for team building‚ these space limitations are now impacting business productivity. NuggetLabs has now leased an additional office building roughly 20Km from their headquarters location. While this office will eventually connect to the HQ office‚ it will initially

    Premium IP address Subnetwork Internet

    • 4941 Words
    • 20 Pages
    Good Essays
  • Better Essays

    computing resource (Shang et al. 2015). Thus‚ a variety of algorithms are given by researchers to find sub-optimal solution of the problem in a limited time (Shang et al. 2015). In general‚ there are two categories: heuristics and meta-heuristics. Among them‚ the representative heuristic algorithms: in 1983‚ Golden et al. (1983) proposed Augment-Merge algorithm and Path-Scanning algorithm (Golden and Wong 1981). In Path-Scanning algorithm‚ all tasks will be inserted into the loop according to some

    Premium Optimization Mathematics Operations research

    • 1831 Words
    • 8 Pages
    Better Essays
  • Best Essays

    Master Application

    • 3782 Words
    • 24 Pages

    org/journal/iim) The Line Clipping Algorithm Basing on Affine Transformation Wenjun Huang College of Math and Computer Science‚ Guangxi University for Nationalities‚ Nanning‚ China E-mail: hwjart@126.com Received March 20‚ 2010; revised April 25‚ 2010; accepted May 27‚ 2010 Abstract A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments

    Premium Line Curve

    • 3782 Words
    • 24 Pages
    Best Essays
Page 1 40 41 42 43 44 45 46 47 50