on the developed theory were proposed. This made statistical learning theory not only a tool for the theoretical analysis but also a tool for creating practical algorithms for estimating multidimensional functions. This article presents a very general overview of statistical learning theory including both

Input queueing is becoming increasingly used for highbandwidth switches and routers. In previous work, it was proved that it is possible to achieve 100 % throughput for input-queued switches using a combination of virtual output queueing and a scheduling algorithm called LQF. However, this is only

The input-queued (IQ) switching architecture is becoming an attractive alternative for high speed switches owing to its scalability. In this paper, two new algorithms, referred to as maximum credit first (MCF) algorithm and iterative maximum credit first (IMCF) algorithm, are introduced. Theoretic

Abstract-In this paper, a concurrent transmission scheduling algorithm is proposed to enhance the resource utilization efficiency for multi-Gbps millimeter-wave (mmWave) networks. Specifically, we exploit spatial-time division multiple access (STDMA) to improve the system throughput by allowing

are hard to be deployed due to either extreme complexity or the modification of TCP protocol. Inspired by the fairness and practicality of Deficit Round Robin (DRR), we proposed a novel scheduling mechanism, namely Deficit Round Robin with Short Flow First (DRR-SFF), which improves the performance of short

This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMD-style computation is “work stealing," in which processors needing work steal

The problem of multiprogram scheduling on a single processor is studied from the viewpoint...

1994]. What are the right scheduling algorithms for taking advantage of reduced clock-speed, especially in the presence of applications demanding ever more instructions-per-second? We consider several methods for varying the clock speed dynamically under control of the operating system, and examine

an off-line algorithm that computes, for any set of jobs, a minimum-energy schedule. We then consider some on-line algorithms and their competitive performance for the power function P(s) = sp where p 3 2. It is shown that one natural heuristic, called the Average Rate heuristic, uses at most a constant

that the agents ’ interests are best served by behaving correctly. Following notions from the field of mechanism design, we suggest a framework for studying such algorithms. Our main technical contribution concerns the study of a representative task scheduling problem for which the standard mechanism design tools