Browsing LAMSADE (UMR CNRS 7243) by Title

FACETA*: Checkpointing for Transactional Composite Web Service Execution based on Petri-Nets

Cardinale, Yudith; Angarita Arocha, Rafaël; Rukoz, Marta (2012) Article accepté pour publication ou publié

FaCETa: Backward and Forward Recovery for Execution of Transactional Composite WS

Angarita Arocha, Rafaël; Cardinale, Yudith; Rukoz, Marta (2012) Communication / Conférence

Facing threats by sharing information for natural resources management

Paget, Nicolas (2016-10-03) Thèse

Factors of perceived walkability: A pilot empirical study

Blečić, Ivan; Canu, Dario; Cecchini, Arnaldo; Congiu, Tanja; Fancello, Giovanna (2016) Communication / Conférence

A fair and efficient payoff based modeling the coalition formation process for games with valuations

Airiau, Stéphane (2013) Communication / Conférence

Fair Division of Indivisible Goods

Lang, Jérôme; Rothe, Jörg (2016) Chapitre d'ouvrage

Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods

Bouveret, Sylvain; Endriss, Ulle; Lang, Jérôme (2010) Communication / Conférence

The Fair OWA One-to-One Assignment Problem: NP-Hardness and Polynomial Time Special Cases

Lesca, Julien; Minoux, Michel; Perny, Patrice (2019) Article accepté pour publication ou publié

Fair Resource Allocation in Systems With Complete Information Sharing

Fossati, Francesca; Hoteit, Sahar; Moretti, Stefano; Secci, Stefano (2018) Article accepté pour publication ou publié

Fair solutions for some multiagent optimization problems

Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme (2013) Article accepté pour publication ou publié

Fast algorithms for Max Independant Set in graphs of small average degree

van Rooij, Johan; Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2008) Document de travail / Working paper

Fast Algorithms for max independent set

Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis; Van Rooij, Johan (2012) Article accepté pour publication ou publié

Fast Algorithms for min independent dominating set

Bourgeois, Nicolas; Escoffier, Bruno; Paschos, Vangelis (2010) Communication / Conférence

Fast algorithms for min independent dominating set

Bourgeois, Nicolas; Della Croce, Federico; Escoffier, Bruno; Paschos, Vangelis (2013) Communication / Conférence

Fast nGram-Based String Search Over Data Encoded Using Algebraic Signatures

Litwin, Witold; Mokadem, Riad; Rigaux, Philippe; Schwartz, Thomas (2007) Communication / Conférence

Fast Reoptimization for the Minimum Spanning Tree Problem

Boria, Nicolas; Paschos, Vangelis (2010) Article accepté pour publication ou publié

Fast User Notification in Large-Scale Digital Librairies: Experiments and Results

Belhaj Frej, Hanen; Rigaux, Philippe; Spyratos, Nicolas (2007) Communication / Conférence

Fault Tolerant Execution of Transactional CompositeWeb Services: An Approach

Rukoz, Marta; Cardinale, Yudith (2011) Communication / Conférence

A Fault-Contained Spanning Tree Protocol for Arbitrary Networks

El Haddad, Joyce; Haddad, Serge (2004) Communication / Conférence

A fault-tolerant communication mechanism for cooperative robots

El Haddad, Joyce; Haddad, Serge (2004) Article accepté pour publication ou publié