299 search results - page 20 / 60 » DNA Computing for Complex Scheduling Problem |
COMCOM
2010
14 years 9 months ago
2010
This work considers the mini-slot scheduling problem in IEEE 802.16d wireless mesh networks (WMNs). An efficient mini-slot scheduling needs to take into account the transmission o...
IPCO
2008
15 years 1 months ago
2008
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
WSC
2007
15 years 2 months ago
2007
Planning and steering numerical experiments that involve many simulations are difficult tasks to automate. We describe how a simulation scheduling tool can help experimenters sub...