937 search results - page 167 / 188 » On the Complexity of Partial Order Properties |
ALGOSENSORS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We consider the problem of counting the number of indistinguishable targets using a simple binary sensing model. Our setting includes an unknown number of point targets i...
ATVA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
105
click to vote
CLUSTER
2005
IEEE
15 years 3 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
WOSP
2005
ACM
15 years 3 months ago
2005
ACM
In order to effectively validate the performance of software systems throughout their development cycle it is necessary to continuously build performance models from software mod...