Sciweavers

284 search results - page 29 / 57
» What Matchings Can Be Stable
Sort
View
FAC
2008
114views more  FAC 2008»
13 years 8 months ago
Specification of communicating processes: temporal logic versus refusals-based refinement
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...
Gavin Lowe
DAGSTUHL
2004
13 years 10 months ago
The communication complexity of the Exact-N Problem revisited
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x + y + z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, a...
William I. Gasarch, James Glenn, Andrey Utis
VR
2008
IEEE
180views Virtual Reality» more  VR 2008»
13 years 8 months ago
Transfer of learning in virtual environments: a new challenge?
: The aim of all education is to apply what we learn in different contexts and to recognise and extend this learning to new situations. Virtual learning environments can used to bu...
Cyril Bossard, Gilles Kermarrec, Cédric Buc...
IJIPT
2006
127views more  IJIPT 2006»
13 years 8 months ago
Distribution concerns in service-oriented modelling
Service-oriented development offers a novel architectural approach that addresses crucial characteristics of modern business process development such as dynamic evolution, intra- ...
Nasreddine Aoumeur, José Luiz Fiadeiro, Cri...
HYBRID
2000
Springer
14 years 2 days ago
Optimization-Based Verification and Stability Characterization of Piecewise Affine and Hybrid Systems
In this paper, we formulate the problem of characterizing the stability of a piecewise affine (PWA) system as a verification problem. The basic idea is to take the whole Rn as the ...
Alberto Bemporad, Fabio Danilo Torrisi, Manfred Mo...