Sciweavers

5580 search results - page 256 / 1116
» Randomized priority algorithms
Sort
View
ICC
2007
IEEE
111views Communications» more  ICC 2007»
16 years 20 days ago
SecureRank: A Risk-Based Vulnerability Management Scheme for Computing Infrastructures
— In this paper, we introduce a new scheme called SecureRank for prioritizing vulnerabilities to patch in computing systems/networks. This has become a key issue for IT infrastru...
Reiko Ann Miura-Ko, Nicholas Bambos
189
Voted
HPDC
2010
IEEE
15 years 6 months ago
Toward high performance computing in unconventional computing environments
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
Brent Rood, Nathan Gnanasambandam, Michael J. Lewi...
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 6 months ago
Improved Squeaky Wheel Optimisation for Driver Scheduling
Abstract. This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation'...
Uwe Aickelin, Edmund K. Burke, Jingpeng Li
JSAC
2011
115views more  JSAC 2011»
15 years 1 months ago
Scalable Cross-Layer Wireless Access Control Using Multi-Carrier Burst Contention
Abstract—The increasing demand for wireless access in vehicular environments (WAVE) supporting a wide range of applications such as traffic safety, surveying, infotainment etc.,...
Bogdan Roman, Ian J. Wassell, Ioannis Chatzigeorgi...
ICDCS
2007
IEEE
16 years 20 days ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta