Sciweavers

258 search results - page 12 / 52
» Weak Bisimulation Approximants
Sort
View
ENTCS
2007
96views more  ENTCS 2007»
14 years 9 months ago
An Observational Theory for Mobile Ad Hoc Networks
We propose a process calculus to study the behavioural theory of Mobile Ad Hoc Networks. The operational semantics of our calculus is given both in terms of a Reduction Semantics ...
Massimo Merro
VMCAI
2012
Springer
13 years 5 months ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang
COCOON
2004
Springer
15 years 2 months ago
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
Yong Zhang, Hong Zhu
JC
2006
68views more  JC 2006»
14 years 9 months ago
Monte Carlo approximation of weakly singular integral operators
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
Stefan Heinrich
SYNASC
2007
IEEE
138views Algorithms» more  SYNASC 2007»
15 years 3 months ago
Some Applications of Weakly Picard Operators
Abstract. In this paper we give some applications of weakly Picard operators theory to linear positive approximation operators, to difference equations with deviating argument and...
Ioan A. Rus