Sciweavers

1055 search results - page 83 / 211
» Enumerations in computable structure theory
Sort
View
JSW
2007
126views more  JSW 2007»
14 years 9 months ago
On Remote and Virtual Experiments in eLearning
— The science of physics is based on theories and models as well as experiments: the former structure relations and simplify reality to a degree such that predictions on physical...
Sabina Jeschke, Harald Scheel, Thomas Richter, Chr...
STACS
2009
Springer
15 years 4 months ago
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
Daniel Kirsten, Sylvain Lombardy
SEFM
2003
IEEE
15 years 3 months ago
A Formal Model for Trust in Dynamic Networks
We propose a formal model of trust informed by the Global Computing scenario and focusing on the aspects of trust formation, evolution, and propagation. The model is based on a no...
Marco Carbone, Mogens Nielsen, Vladimiro Sassone
63
Voted
CIE
2005
Springer
15 years 3 months ago
Some Reducibilities on Regular Sets
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
Victor L. Selivanov
BIRTHDAY
2006
Springer
15 years 1 months ago
Horizontal Composability Revisited
We recall the contribution of Goguen and Burstall's 1980 CAT paper and its powerful influence on theories of specification implementation that were emerging at about the same ...
Donald Sannella, Andrzej Tarlecki