15033 search results - page 267 / 3007 » Complexity Theory and Algorithms |
199
click to vote
ICALP
2005
Springer
16 years 23 days ago
2005
Springer
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
175
click to vote
CORR
2004
Springer
15 years 7 months ago
2004
Springer
: Since no fusion theory neither rule fully satisfy all needed applications, the author proposes a Unification of Fusion Theories and a combination of fusion rules in solving probl...
213
click to vote
AAAI
1993
15 years 8 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
207
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
Earlier work has developed the underpinnings of IC-Scheduling Theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computi...
216
click to vote
LPAR
2004
Springer
16 years 18 days ago
2004
Springer
DPLL and DPLL Modulo Theories Robert Nieuwenhuis , Albert Oliveras , and Cesare Tinelli We introduce Abstract DPLL, a general and simple abstract rule-based formulation of the Davi...