256 search results - page 33 / 52 » Timing Verification by Successive Approximation |
116
click to vote
WCNC
2010
IEEE
15 years 3 months ago
2010
IEEE
—This paper considers the tradeoff between bursty and continuous transmissions in wireless ad hoc networks. In our network model, packets belonging to specific transmitters arri...
EOR
2006
14 years 11 months ago
2006
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...
IJHPCA
2006
14 years 11 months ago
2006
Effective communication between user and scheduler is an important prerequisite to achieving a successful scheduling outcome from both parties' perspectives. In a grid or sta...
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
ANOR
2010
14 years 12 months ago
2010
We study some mathematical programming formulations for the origin-destination model in airline revenue management. In particular, we focus on the traditional probabilistic model ...