Sciweavers

1792 search results - page 26 / 359
» Improved scheduling in rings
Sort
View
GECCO
1999
Springer
126views Optimization» more  GECCO 1999»
13 years 11 months ago
Improving Genetic Algorithms by Search Space Reductions (with Applications to Flow Shop Scheduling)
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
Stephen Y. Chen, Stephen F. Smith
MANSCI
2010
95views more  MANSCI 2010»
13 years 5 months ago
Using Scheduled Ordering to Improve the Performance of Distribution Supply Chains
We study a supply chain with one supplier and many retailers that face exogenous endcustomer demands. The supplier and the retailers all try to minimize their own inventory-relate...
Lucy Gongtao Chen, Srinagesh Gavirneni
MOBIHOC
2009
ACM
14 years 8 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant
ICC
2009
IEEE
137views Communications» more  ICC 2009»
13 years 5 months ago
Distributed Multi-User Scheduling for Improving Throughput of Wireless LAN
Carrier Sense Multi-Access (CSMA) is a typical method to share the common channel in a Wireless LAN (WLAN). It works fairly well in times of light traffic. However as the number of...
Suhua Tang, Ryu Miura, Sadao Obana
CISIS
2011
IEEE
12 years 7 months ago
Improving Scheduling Techniques in Heterogeneous Systems with Dynamic, On-Line Optimisations
—Computational performance increasingly depends on parallelism, and many systems rely on heterogeneous resources such as GPUs and FPGAs to accelerate computationally intensive ap...
Marcin Bogdanski, Peter R. Lewis, Tobias Becker, X...