Sciweavers

1404 search results - page 52 / 281
» Complexity of admissible rules
Sort
View
VVEIS
2007
13 years 11 months ago
Checking Complex Compositions of Web Services Against Policy Constraints
Research in web services has allowed reusable, distributed, loosely coupled components which can easily be composed to build systems or to produce more complex services. Compositio...
Andrew Dingwall-Smith, Anthony Finkelstein
IWPEC
2009
Springer
14 years 4 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke
AI
2007
Springer
14 years 4 months ago
Rethinking the Semantics of Complex Nominals
Complex Nominals (CNs) have simple syntactic structure that conceals non-trivial semantic characteristics. While speakers of natural languages combine noun(s)/adjective(s) with a h...
Nabil Abdullah, Richard A. Frost
ACSAC
2006
IEEE
14 years 4 months ago
Backtracking Algorithmic Complexity Attacks against a NIDS
Network Intrusion Detection Systems (NIDS) have become crucial to securing modern networks. To be effective, a NIDS must be able to counter evasion attempts and operate at or near...
Randy Smith, Cristian Estan, Somesh Jha
WIA
2000
Springer
14 years 1 months ago
Solving Complex Problems Efficiently with Adaptive Automata
- Adaptive technologies are based on the self-modifying property of some systems, which give their users a very powerful and convenient facility for expressing and handling complex...
João José Neto