388 search results - page 20 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
RTAS
2008
IEEE
14 years 3 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
DISOPT
2008
13 years 8 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
COR
2010
13 years 8 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
— Directional antennas are very attractive in Wireless Mesh Networks (WMN). We study the problem of link scheduling and power control in a Time-Division Multiple Access (TDMA) WM...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...