720 search results - page 77 / 144 » Broadcast scheduling: algorithms and complexity |
146
Voted
NOCS
2007
IEEE
16 years 13 days ago
2007
IEEE
Many DSP algorithms are very computationally intensive. They are typically implemented using an ensemble of processing elements (PEs) operating in parallel. The results from PEs n...
146
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
155
Voted
PATAT
1995
Springer
15 years 9 months ago
1995
Springer
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...
189
Voted
ICICIC
2006
IEEE
16 years 6 days ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
198
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...