Sciweavers

16 search results - page 3 / 4
» Nearly optimal perfectly periodic schedules
Sort
View
GLOBECOM
2009
IEEE
14 years 2 days ago
Channel Aware Distributed Random Access
—We investigate distributed channel-aware random access for networks with arbitrary topologies and traffic distributions, where users can receive traffic from or send traffic ...
Guowang Miao, Ye (Geoffrey) Li, Ananthram Swami
CCE
2004
13 years 5 months ago
Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation
Multiproduct pipelines permit to transport large volumes of a wide range of refined petroleum products from major supply sources to distribution centers near market areas. Batches...
Diego C. Cafaro, Jaime Cerdá
IJCAI
1989
13 years 6 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
ISCA
1998
IEEE
107views Hardware» more  ISCA 1998»
13 years 9 months ago
Memory Dependence Prediction Using Store Sets
For maximum performance, an out-of-order processor must issue load instructions as early as possible, while avoiding memory-order violations with prior store instructions that wri...
George Z. Chrysos, Joel S. Emer
NCA
2007
IEEE
13 years 11 months ago
Scheduling Bulk File Transfers with Start and End Times
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
Kannan Rajah, Sanjay Ranka, Ye Xia