874 search results - page 22 / 175 » Optimal Scheduling of Contract Algorithms for Anytime Proble... |
150
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— The input-queued switch architecture is widely used in Internet routers, due to its ability to run at very high line speeds. A central problem in designing an input-queued swit...
126
click to vote
DAC
1999
ACM
16 years 5 months ago
1999
ACM
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers,...
155
click to vote
SAGA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Motivated by an application in project portfolio analysis under uncertainty, we develop an algorithm S-VNS for solving stochastic combinatorial optimization (SCO) problem...
139
click to vote
HM
2007
Springer
15 years 10 months ago
2007
Springer
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
139
click to vote
GLOBECOM
2007
IEEE
15 years 5 months ago
2007
IEEE
— 1 In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences sc...