Skip to main content Accessibility help
×
  1. Home
  2. Browse subjects
  3. Engineering
  4. Communications, Signal Processing and Information Theory

Refine listing

Refine listing

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

9096 results in Communications, Signal Processing and Information Theory

Page 67 of 455

Machine Learning Fundamentals
  • A Concise Introduction
  • Hui Jiang
  • Published online:
    18 November 2021
    Print publication:
    25 November 2021
  • This lucid, accessible introduction to supervised machine learning presents core concepts in a focused and logical way that is easy for beginners to follow. The author assumes basic calculus, linear algebra, probability and statistics but no prior exposure to machine learning. Coverage includes widely used traditional methods such as SVMs, boosted trees, HMMs, and LDAs, plus popular deep learning methods such as convolution neural nets, attention, transformers, and GANs. Organized in a coherent presentation framework that emphasizes the big picture, the text introduces each method clearly and concisely “from scratch” based on the fundamentals. All methods and algorithms are described by a clean and consistent style, with a minimum of unnecessary detail. Numerous case studies and concrete examples demonstrate how the methods can be applied in a variety of contexts.

  • 12 - Processing Networks and Maximum Pressure Policies

  • from Part IV - Fluid Models of Multi-Class Queueing
  • Gideon Weiss, University of Haifa, Israel
  • Book:
    Scheduling and Control of Queueing Networks
    Published online:
    01 October 2021
    Print publication:
    14 October 2021, pp 197-218

  • Summary

    We introduces some more general processing networks and the maximum pressure policy, which uses local information for decentralized control of the network. Maximum pressure policies can guarantee the stability of MCQN as well as of more general processing networks, under some simple structure conditions, whenever traffic intensity rho < 1.

  • 4 - The G/G/1 Queue

  • from Part II - Approximations of the Single Queue
  • Gideon Weiss, University of Haifa, Israel
  • Book:
    Scheduling and Control of Queueing Networks
    Published online:
    01 October 2021
    Print publication:
    14 October 2021, pp 61-70

  • Summary

    We present the ingenious scheme devised by Loynes to show that G/G/1 with stationary arrival and service processes is stable when the traffic intensity rho < 1, and transient if rho > 1. Under the stronger assumption that interarrivals and services are i.i.d., we explore the connection of the GI/GI/1 queue with the general random walk and obtain an insightful upper bound on waiting time.

  • 9 - Generalized Jackson Networks

  • from Part III - Queueing Networks
  • Gideon Weiss, University of Haifa, Israel
  • Book:
    Scheduling and Control of Queueing Networks
    Published online:
    01 October 2021
    Print publication:
    14 October 2021, pp 143-156

  • Summary

    We discuss the classic Jackson network with general i.i.d. interarrivals and service times, the generalized Jackson network. Like the GI/GI/1 system, the generalized Jackson network cannot be analyzed in detail, and we discuss fluid and diffusion approximations to the network process.

Page 67 of 455