Sciweavers

305 search results - page 13 / 61
» Decidability of Split Equivalence
Sort
View
APN
2009
Springer
14 years 2 months ago
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication
In previous works we defined ν-APNs, an extension of P/T nets with the capability of creating and managing pure names. We proved that, though reachability is undecidable, coverab...
Fernando Rosa Velardo, David de Frutos-Escrig
ICC
2009
IEEE
103views Communications» more  ICC 2009»
14 years 2 months ago
Optimization of Split-And-Combine Relaying
Relays play an important role for increasing rate and reducing energy consumption of wireless networks. In this paper we consider a three-node network (source, relay, destination)...
Raymond Yim, Andreas F. Molisch, Jinyun Zhang
ICML
2002
IEEE
14 years 8 months ago
Learning Decision Trees Using the Area Under the ROC Curve
ROC analysis is increasingly being recognised as an important tool for evaluation and comparison of classifiers when the operating characteristics (i.e. class distribution and cos...
César Ferri, José Hernández-O...
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 8 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
ESSLLI
1999
Springer
13 years 12 months ago
Weak Equivalence in Propositional Calculus
Abstract. The main purpose of this paper is to present a new algorithm (NEWSAT) for deciding the (un)satisfiability of propositional formulae. It is based on a somehow dual (versu...
Stefan Andrei