790 search results - page 33 / 158 » Limits of Work-Stealing Scheduling |
125
Voted
CN
2006
15 years 17 days ago
2006
As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained ...
135
Voted
ATAL
2011
Springer
14 years 15 days ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
119
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—The demand for capacity in WiFi networks is driving a new look at transmission scheduling based link layers, particularly in the context of mesh networks. One basic issue here i...
CP
2004
Springer
15 years 6 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
122
Voted
JSAC
2010
14 years 11 months ago
2010
—Due to the geographic distribution of its subscribers, Ethernet Passive Optical Networks (EPONs) have typically varying propagation delays between the Optical Network Units (ONU...