1094 search results - page 111 / 219 » On Computing Explanations in Argumentation |
SIGSOFT
2009
ACM
15 years 12 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
SMA
2005
ACM
15 years 4 months ago
2005
ACM
In the parametric feature based design paradigm, most features possess arguments that are subsets of the boundary of the current model, subsets defined interactively by user sele...
ARGMAS
2004
Springer
15 years 4 months ago
2004
Springer
Argumentation-based negotiation (ABN) is an effective means of resolving conflicts in a multi-agent society. However, it consumes both time and computational resources for agents ...
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
105
click to vote
COMPGEOM
1996
ACM
15 years 3 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...