5900 search results - page 1044 / 1180 » Dependable Systems |
192
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
168
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Data-intensive applications often require exploratory analysis of large datasets. If analysis is performed on distributed resources, data locality can be crucial to high throughpu...
143
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Information-driven networks include a large category of networking systems, where network nodes are aware of information delivered and thus can not only forward data packets but m...
188
click to vote
ENTCS
2008
15 years 6 months ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
181
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...