Sciweavers

5 search results - page 1 / 1
» Computing with Sequences, Weak Topologies and the Axiom of C...
Sort
View
CSL
2005
Springer
14 years 17 days ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder
CONCUR
1994
Springer
13 years 11 months ago
Weak Sequential Composition in Process Algebras
Abstract. In this paper we study a special operator for sequential composition, which is de ned relative to a dependency relation over the actions of a given system. The idea is th...
Arend Rensink, Heike Wehrheim
AAAI
2008
13 years 9 months ago
Perpetual Learning for Non-Cooperative Multiple Agents
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
Luke Dickens
PEWASUN
2007
ACM
13 years 8 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
WSCG
2003
167views more  WSCG 2003»
13 years 8 months ago
Vector-valued Image Restoration with Applications to Magnetic Resonance Velocity Imaging
The analysis of blood flow patterns and the interaction between salient topological flow features and cardiovascular structure plays an important role in the study of cardiovascul...
Yin-Heung Pauline Ng, Guang-Zhong Yang