5580 search results - page 339 / 1116 » Randomized priority algorithms |
198
click to vote
IEEEPACT
1998
IEEE
15 years 11 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
207
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
—In cognitive radio (CR) networks, there are scenarios where the secondary (lower priority) users intend to communicate with each other by opportunistically utilizing the transmi...
183
Voted
SIAMCOMP
2002
15 years 6 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
236
Voted
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
171
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper describes the dynamic load-balancing and high performance communication provided in Jcluster, an efficient Java parallel environment. For the efficient loadbalancing,...