Sciweavers

7109 search results - page 83 / 1422
» Process Algebra with Combinators
Sort
View
CSR
2009
Springer
14 years 11 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
COMPUTING
2007
103views more  COMPUTING 2007»
14 years 10 months ago
An algebraic approach for H-matrix preconditioners
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
S. Oliveira, F. Yang
TCS
2011
14 years 5 months ago
Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...
Donatella Merlini, Renzo Sprugnoli
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
15 years 3 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 3 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena