5348 search results - page 68 / 1070 » Models for the Compressible Web |
IEICET
2008
14 years 10 months ago
2008
In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with a...
ENTCS
2007
14 years 10 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
AINA
2009
IEEE
15 years 4 months ago
2009
IEEE
The Semantics-based Web Service Matching Model is proposed in this paper to improve the performance of Web Service discovery. Semantics-based Web Service Matching is a two-phase m...
BIS
2008
14 years 11 months ago
2008
Web2.0 has revolutionized the way we use the Web by opening the doors of collaborative learning and direct communication and making the web an open source for learning and exchangi...
SPIN
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their corr...