Results 131 to 140 of about 443 (167)
Some of the next articles are maybe not open access.
IF-preorder, IF-topology and IF-automata
International Journal of Machine Learning and Cybernetics, 2013The concept of topologies are widely used in machine learning, and fuzzy automata are used as models of machine learning systems. An advantage of employing fuzzy automaton as a model of machine learning system is its simplicity in design and computation.
S. P. Tiwari, Anupam K. Singh
openaire +1 more source
Algebra and Logic, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An efficiency preorder for processes
Acta Informatica, 1991A simple efficiency preorder for CCS processes is introduced in which \(p\preceq q\) means that \(q\) is at least as fast as \(p\), or more generally, \(p\) uses at least as much resources as \(q\). It is shown to be preserved by all CCS contexts except summation and it is used to analyse a non-trivial example: two different implementations of a ...
S. Arun-Kumar, Matthew Hennessy
openaire +2 more sources
2007
We define a language for Web services contracts as a parallel-free fragment of ccs and we study a natural notion of compliance between clients and services in terms of their corresponding contracts. The induced contract preorder turns out to be valuable in searching and querying registries of Web services, it shows interesting connections with the must
C. Laneve, L. Padovani
openaire +2 more sources
We define a language for Web services contracts as a parallel-free fragment of ccs and we study a natural notion of compliance between clients and services in terms of their corresponding contracts. The induced contract preorder turns out to be valuable in searching and querying registries of Web services, it shows interesting connections with the must
C. Laneve, L. Padovani
openaire +2 more sources
How to Revise a Total Preorder
Journal of Philosophical Logic, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard Booth 0001, Thomas Andreas Meyer
openaire +2 more sources
Consequences and conjectures in preordered sets
Information Sciences, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enric Trillas +2 more
exaly +2 more sources
On fuzzy syntopogenous structures and preorder
Fuzzy Sets and Systems, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mo Zhi Wen, Liu Wang Jin, Shu Lan
openaire +1 more source
Performance preorder and competitive equivalence
Acta Informatica, 1997A preorder based on execution speed, called performance preorder, is introduced for a simple process algebra with durational actions. Two processes \(E\) and \(F\) are related -- \(E\sqsubseteq_p F\) -- if they have the same functionality (in this case, we have chosen strong bisimulation equivalence) and \(E\) is at least as fast as \(F\).
Corradini F., Gorrieri R., Roccetti M.
openaire +2 more sources
Syntopogenous preordered spaces (II)
Mathematical Proceedings of the Cambridge Philosophical Society, 1978In (1) the authors introduced the idea of a syntopogenous preordered space (SPS), thereby generalizing simultaneously the concepts of ‘uniform preordered space’ and ‘proximity preordered space’. In the case of a classical topology the SPS condition was seen to be equivalent to the condition, ‘convex plus T1-preordered’.
Burgess, D. C. J., Fitzpatrick, M.
openaire +1 more source
Filtral Preorders and Opportunity Inequality
SSRN Electronic Journal, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vannucci, Stefano, Savaglio, E.
openaire +3 more sources