Sciweavers

3628 search results - page 622 / 726
» The Decision Diffie-Hellman Problem
Sort
View
129
Voted
DCG
2008
101views more  DCG 2008»
15 years 3 months ago
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes
For polytopes P1, P2 Rd we consider the intersection P1 P2, the convex hull of the union CH(P1 P2), and the Minkowski sum P1 + P2. For Minkowski sum we prove that enumerating t...
Hans Raj Tiwary
121
Voted
EAAI
2008
75views more  EAAI 2008»
15 years 3 months ago
Enacting agent-based services for automated procurement
Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buying agents when trying to determine the best set of provid...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...
138
Voted
AI
2006
Springer
15 years 3 months ago
On the computational complexity of coalitional resource games
We study Coalitional Resource Games (CRGs), a variation of Qualitative Coalitional Games (QCGs) in which each agent is endowed with a set of resources, and the ability of a coalit...
Michael Wooldridge, Paul E. Dunne
117
Voted
ENTCS
2008
102views more  ENTCS 2008»
15 years 3 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
139
Voted
IANDC
2008
150views more  IANDC 2008»
15 years 3 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch