Sciweavers

831 search results - page 54 / 167
» Coalgebraic Correspondence Theory
Sort
View
SYNTHESE
2008
88views more  SYNTHESE 2008»
14 years 11 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
BC
2005
122views more  BC 2005»
14 years 11 months ago
On partial contraction analysis for coupled nonlinear oscillators
We describe a simple but general method to analyze networks of coupled identical nonlinear oscillators, and study applications to fast synchronization, locomotion, and schooling. ...
Wei Wang 0008, Jean-Jacques E. Slotine
IJUFKS
2000
65views more  IJUFKS 2000»
14 years 11 months ago
Some Group Theoretic Aspects of t-Norms
Continuous archimedean t-norms are generated by automorphisms f of ([0; 1]; ), the unit interval with its usual order structure. Such strict t-norms 4 are given by x 4 y = f 1 (f(...
Fred Richman, Elbert A. Walker
FSS
2010
111views more  FSS 2010»
14 years 10 months ago
The geometry of consonant belief functions: Simplicial complexes of necessity measures
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
Fabio Cuzzolin
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
14 years 10 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani