Sciweavers

1559 search results - page 83 / 312
» Some Group Theory Problems
Sort
View
128
Voted
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 9 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
AI
2006
Springer
15 years 4 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
ECAI
1998
Springer
15 years 8 months ago
The Complexity of Model Checking for Propositional Default Logics
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
Paolo Liberatore, Marco Schaerf
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 1 months ago
Time-Symmetric Cellular Automata
Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward t...
Andrés Moreira, Anahí Gajardo
144
Voted
LICS
2003
IEEE
15 years 9 months ago
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
Hubert Comon-Lundh, Vitaly Shmatikov