Sciweavers

315 search results - page 14 / 63
» What is algebraic in process theory
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 6 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
INFOCOM
2006
IEEE
14 years 22 days ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
ACS
2011
13 years 1 months ago
The Patch Construction is Dual to Algebraic DCPO Representation
Using the parallel between the preframe and the suplattice approach to locale theory it is shown that the patch construction, as an action on topologies, is the same thing as the ...
Christopher F. Townsend
ICMLA
2008
13 years 8 months ago
Multi-stage Learning of Linear Algebra Algorithms
In evolving applications, there is a need for the dynamic selection of algorithms or algorithm parameters. Such selection is hardly ever governed by exact theory, so intelligent r...
Victor Eijkhout, Erika Fuentes
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
14 years 27 days ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...