5550 search results - page 874 / 1110 » Different Approaches to Proof Systems |
191
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
In synthesis we construct finite state systems from temporal specifications. While this problem is well understood in the classical setting of non-probabilistic synthesis, this pap...
168
click to vote
EDOC
2004
IEEE
15 years 10 months ago
2004
IEEE
The era of distributed systems is upon us. Middlewarespecific concerns, and especially the distribution concern, which is the core of any middleware-mediated application, are addr...
200
click to vote
CMSB
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
193
click to vote
DEXA
2006
Springer
15 years 10 months ago
2006
Springer
Recent work on continuous queries has focused on processing queries in very large, mobile environments. In this paper, we propose a system leveraging the computing capacities of mo...
179
click to vote
CIARP
2003
Springer
15 years 10 months ago
2003
Springer
Classification problems are traditionally focused on uniclass samples, that is, each sample of the training and test sets has one unique label, which is the target of the classific...