Sciweavers

22 search results - page 5 / 5
» Analysis of Local Enumeration and Storage Schemes in HPF
Sort
View
ICALP
2004
Springer
13 years 11 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
COMCOM
2007
95views more  COMCOM 2007»
13 years 5 months ago
Key management for long-lived sensor networks in hostile environments
Large-scale wireless sensor networks (WSNs) are highly vulnerable to attacks because they consist of numerous resource-constrained devices and communicate via wireless links. Thes...
Michael Chorzempa, Jung Min Park, Mohamed Eltoweis...