Sciweavers

59 search results - page 7 / 12
» Statistical Analyses for Simulating Schedule Networks
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
INFOCOM
1996
IEEE
13 years 12 months ago
Group Priority Scheduling
We present an end-to-end delay guarantee theorem for a class of guaranteed-deadline (GD) servers. The theorem can be instantiated to obtain end-to-end delay bounds for a variety of...
Simon S. Lam, Geoffrey G. Xie
CLUSTER
2005
IEEE
14 years 1 months ago
Minimizing the Network Overhead of Checkpointing in Cycle-harvesting Cluster Environments
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
Daniel Nurmi, John Brevik, Richard Wolski
SEAL
1998
Springer
13 years 12 months ago
Robust Evolution Strategies
This paper empirically investigates the use and behaviour of Evolution Strategies (ES) algorithms on problems such as function optimisation and the use of evolutionary artificial ...
Kazuhiro Ohkura, Yoshiyuki Matsumura, Kanji Ueda
FMOODS
2003
13 years 9 months ago
A Rewriting Based Model for Probabilistic Distributed Object Systems
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The minism provides an abstraction over scheduling, net...
Nirman Kumar, Koushik Sen, José Meseguer, G...