Sciweavers

4218 search results - page 16 / 844
» Complete sets of cooperations
Sort
View
JAIR
2008
110views more  JAIR 2008»
13 years 7 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
CLIMA
2006
13 years 9 months ago
An Argumentation-Based Negotiation for Distributed Extended Logic Programs
Abstract. The paradigm of argumentation has been used in the literature to assign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules...
Iara Carnevale de Almeida, José Júli...
EPS
1998
Springer
13 years 11 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...
JMIV
2002
172views more  JMIV 2002»
13 years 7 months ago
Grey-Scale Morphology Based on Fuzzy Logic
There exist several methods to extend binary morphology to grey-scale images. One of these methods is based on fuzzy logic and fuzzy set theory. Another approach starts from the c...
Ting-Quan Deng, Henk J. A. M. Heijmans
NETWORKING
2007
13 years 9 months ago
Incorporating Protection Mechanisms in the Dynamic Multi-layer Routing Schemes
In the next generation backbone networks, IP/MPLS over optical networks, the ability to maintain an acceptable level of reliability has become crucial since a failure can result in...
Anna Urra, Eusebi Calle, José-Luis Marzo, P...