262 search results - page 48 / 53 » Verifying Web Applications Using Bounded Model Checking |
92
Voted
KDD
2006
ACM
16 years 7 hour ago
2006
ACM
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
101
click to vote
TWC
2008
14 years 11 months ago
2008
Abstract--In this paper, the flow-level performance of opportunistic scheduling in orthogonal frequency division multiplexing (OFDM) networks is studied. The analysis accounts for ...
DLOG
2004
15 years 1 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
195
click to vote
POPL
2005
ACM
15 years 12 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
123
click to vote
FASE
2006
Springer
15 years 3 months ago
2006
Springer
This paper describes the application of the Real-Time Maude tool to the formal specification and analysis of the CASH scheduling algorithm and its suggested modifications. The CASH...