Sciweavers

142 search results - page 6 / 29
» State Elimination Ordering Strategies: Some Experimental Res...
Sort
View
EPS
1998
Springer
15 years 2 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...
DAC
2009
ACM
15 years 10 months ago
Online cache state dumping for processor debug
Post-silicon processor debugging is frequently carried out in a loop consisting of several iterations of the following two key steps: (i) processor execution for some duration, fo...
Anant Vishnoi, Preeti Ranjan Panda, M. Balakrishna...
ATVA
2008
Springer
139views Hardware» more  ATVA 2008»
14 years 11 months ago
Compositional Verification for Component-Based Systems and Application
We present a compositional method for the verification of component-based systems described in a subset of the BIP language encompassing multi-party interaction without data transf...
Saddek Bensalem, Marius Bozga, Joseph Sifakis, Tha...
JAL
2006
114views more  JAL 2006»
14 years 9 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
EPIA
2005
Springer
15 years 3 months ago
Learning to Select Negotiation Strategies in Multi-agent Meeting Scheduling
In this paper, we look at the Multi-Agent Meeting Scheduling problem where distributed agents negotiate meeting times on behalf of their users. While many negotiation approaches ha...
Elisabeth Crawford, Manuela M. Veloso