Sciweavers

937 search results - page 61 / 188
» On the Complexity of Partial Order Properties
Sort
View
ANCS
2005
ACM
15 years 11 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
LICS
1991
IEEE
15 years 9 months ago
Defaults and Revision in Structured Theories
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
Mark Ryan
CCE
2005
15 years 5 months ago
CFD analyses of complex flows
Computational fluid dynamics (CFD) of complex processes and complicated geometries embraces the transport of momentum, heat, and mass including the description of reaction kinetic...
Richard Farmer, Ralph Pike, Gary Cheng
JSAC
2006
157views more  JSAC 2006»
15 years 6 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
MOR
2002
94views more  MOR 2002»
15 years 5 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel