Back to Results
First PageMeta Content
Scheduling algorithms / Queueing theory / Stochastic processes / Adisak Mekkittikul / Thai people / Scheduling / Throughput / Queueing model / Time complexity / Theoretical computer science / Applied mathematics / Mathematics


Document Date: 2002-01-05 02:29:11

Open Document

File Size: 93,93 KB

Share Result on Facebook

/

Facility

Electrical Engineering Stanford University / Computer Sciences University of California at Berkeley / /

IndustryTerm

maximum size matching algorithm / maximum matching algorithm / example using neural networks / maximum weight matching algorithms / maximum weight scheduling algorithms / maximum size algorithm / iSLIP algorithm / graph algorithms / bipartite matching algorithm / iterative algorithms / maximum weight matching algorithm / /

Organization

University of California / InputQueued Switch Nick McKeown Adisak Mekkittikul Department / Stanford University / /

Person

Ai / Jean Walrand / /

Position

head of line / head / /

ProvinceOrState

California / /

SportsLeague

Stanford University / /

Technology

maximum matching algorithm / maximum size algorithm / maximum weight matching algorithm / iSLIP algorithm / three graph algorithms / Maximum Size Matching Algorithms / OCF algorithm / LQF maximum weight matching algorithm / achievable using two maximum weight matching algorithms / maximum size matching algorithm / two maximum weight matching algorithms / second algorithm / maximum weight matching algorithms / simulation / scheduling algorithm / two maximum weight scheduling algorithms / two scheduling algorithms / bipartite matching algorithm / LQF algorithm / OCF maximum weight matching algorithm / scheduling algorithms / using the OCF algorithm / be demonstrated using simulation / using the LQF algorithm / /

SocialTag