554 search results - page 88 / 111 » Approximability of OFDMA Scheduling |
147
click to vote
ATAL
2004
Springer
15 years 10 months ago
2004
Springer
The paper describes the architecture of Brown University’s agent, Botticelli, a finalist in the 2003 Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM,...
154
Voted
CSCLP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Overload checking, forbidden regions, edge finding, and notfirst/not-last detection are well-known propagation rules to prune the start times of activities which have t...
160
click to vote
ICNP
2000
IEEE
15 years 9 months ago
2000
IEEE
Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network remains largely unaddressed because of the unique design issues such as locat...
145
Voted
COCOON
1999
Springer
15 years 9 months ago
1999
Springer
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
132
click to vote
ICCD
1993
IEEE
15 years 9 months ago
1993
IEEE
Ravel-XL is a single-boardhardware accelerator for gate-level digital logic simulation. It uses a standard levelizedcode approach to statically schedule gate evaluations.However, u...