نتایج جستجو برای: c aminii

تعداد نتایج: 1056517  

2009
Stefanie Shattuck-Hufnagel Katherine Williams William F. Ganong Ursula Goldstein Stephen K. Holford Arafim Ordubadi Victor W. Zue

The first experiment involved the intelligibility of alternated speech. In a typical experiment by Cherry and Taylor, and later by Huggins,2 a continuous speech message was periodically switched alternately to the subject's left and right ears, so that one ear received speech, while the other received silence. The intelligibility was assessed by counting the number of words the subject was able...

2006
Patricia Bouyer H S Fabrice Chevalier

In this paper, we survey some of the results which have been obtained the last ten years on the control of hybrid and timed systems.

2003
C C Costas Busch Mukkai S. Krishnamoorthy Malik Magdon-Ismail

Fair cake-cutting is the division of a cake or resource among N users so that each user is content. Users may value a given piece of cake differently, and information about how a user values different parts of the cake can only be obtained by requesting users to “cut” pieces of the cake into specified ratios. Many distributed computing problems which involve resource sharing can be expressed as...

2011
Vasco T. Vasconcelos

We discuss session types independently of any programming language. We then embody the notion in languages from three different paradigms: the pi calculus, a functional language, and an object-oriented language.

2004
Luca Aceto Anna Ingolfsdottir MohammadReza Mousavi Michel A. Reniers

Algebraic properties specify some natural properties of programming and specification constructs. This paper provides an overview of techniques to guarantee or generate algebraic properties of language constructs by investigating the syntactic shape of the deduction rules defining their operational semantics.

2011
Vasco T. Vasconcelos

We discuss session types independently of any programming language. We then embody the notion in languages from three different paradigms: the pi calculus, a functional language, and an object-oriented language.

2008
Dale Miller

We review links between three logic formalisms and three approaches to specifying operational semantics. In particular, we show that specifications written with (small-step and big-step) SOS, abstract machines, and multiset rewriting, are closely related to Horn clauses, binary clauses, and (a subset of) linear logic, respectively. We shall illustrate how binary clauses form a bridge between th...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید