5084 search results - page 363 / 1017 » Proving Possibility Properties |
188
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
182
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...
165
click to vote
COMMA
2006
15 years 8 months ago
2006
We present a procedure for computing the sceptical "ideal semantics" for argumentation in assumption-based frameworks. This semantics was first proposed for logic program...
187
click to vote
COMMA
2006
15 years 8 months ago
2006
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...
202
click to vote
DBSEC
2006
15 years 8 months ago
2006
We demonstrate how access control models and policies can be represented by using term rewriting systems, and how rewriting may be used for evaluating access requests and for provi...