720 search results - page 50 / 144 » Broadcast scheduling: algorithms and complexity |
170
click to vote
HM
2007
Springer
16 years 10 days ago
2007
Springer
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
145
click to vote
SACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Inthis paper we present several weaknesses in the keyscheduling algorithm of RC4, and describe their cryptanalytic signi cance. We identify a large number of weak keys, i...
166
click to vote
ACSD
2009
IEEE
16 years 1 months ago
2009
IEEE
Asynchronous and latency-insensitive circuits offer a similar form of elasticity that tolerates variations in the delays of communication resources of a system. This flexibility ...
147
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
162
click to vote
CCE
2008
15 years 5 months ago
2008
Scheduling of processes in mixed batch/continuous plants, due to their hybrid nature can become very complex. This paper presents the Timed Hybrid Petri net (THPN) as a suitable t...