Sciweavers

1458 search results - page 69 / 292
» Extended Term Rewriting Systems
Sort
View
ATAL
2008
Springer
14 years 12 months ago
Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments
Coalition formation is an important capability for automated negotiation among self-interested agents. In order for coalitions to be stable, a key question that must be answered i...
Naoki Ohta, Vincent Conitzer, Yasufumi Satoh, Atsu...
INFOCOM
2010
IEEE
14 years 8 months ago
Extending Access Point Connectivity through Opportunistic Routing in Vehicular Networks
—Nowadays, the navigation systems available on cars are becoming more and more sophisticated. They greatly improve the experience of drivers and passengers by enabling them to re...
Ilias Leontiadis, Paolo Costa, Cecilia Mascolo
CADE
2009
Springer
15 years 10 months ago
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
Carsten Fuhs, Jürgen Giesl, Michael Parting, ...
BIRTHDAY
2009
Springer
15 years 4 months ago
Mobile Processes and Termination
Abstract. This paper surveys some recent works on the study of termination in a concurrent setting. Processes are π-calculus processes, on which type systems are imposed that ensu...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...
RTA
2005
Springer
15 years 3 months ago
Orderings for Innermost Termination
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
Mirtha-Lina Fernández, Guillem Godoy, Alber...