Sciweavers

1912 search results - page 161 / 383
» On the evaluation of argumentation formalisms
Sort
View
EPS
1998
Springer
15 years 10 months ago
Complete Classes of Strategies for the Classical Iterated Prisoner's Dilemma
The Classical Iterated Prisoner's Dilemma (CIPD) is used to study the evolution of cooperation. We show, with a genetic approach, how basic ideas could be used in order to gen...
Bruno Beaufils, Jean-Paul Delahaye, Philippe Mathi...
PLILP
1992
Springer
15 years 10 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
ARGMAS
2006
Springer
15 years 10 months ago
Negotiating Using Rewards
In situations where self-interested agents interact repeatedly, it is important that they are endowed with negotiation techniques that enable them to reach agreements that are pro...
Sarvapali D. Ramchurn, Carles Sierra, Lluis Godo, ...
ICALP
2000
Springer
15 years 10 months ago
A Statically Allocated Parallel Functional Language
Abstract. We describe SAFL, a call-by-value first-order functional language which is syntactically restricted so that storage may be statically allocated to fixed locations. Evalua...
Alan Mycroft, Richard Sharp
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
15 years 10 months ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson