10106 search results - page 403 / 2022 » Algorithm Selection and Scheduling |
206
Voted
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
172
click to vote
HPCC
2005
Springer
16 years 10 days ago
2005
Springer
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...
152
Voted
CCGRID
2009
IEEE
16 years 1 months ago
2009
IEEE
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...
183
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—This paper presents a new desynchronization algorithm aimed at providing collision-free transmission scheduling for single-hop and acyclic multi-hop wireless sensor netw...
160
click to vote
CISS
2008
IEEE
16 years 1 months ago
2008
IEEE
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...