Sciweavers

3713 search results - page 602 / 743
» Constructing a Calculus of Programs
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
14 years 10 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
ALGORITHMICA
2006
163views more  ALGORITHMICA 2006»
14 years 10 months ago
Building Large Phylogenetic Trees on Coarse-Grained Parallel Machines
Phylogenetic analysis is an area of computational biology concerned with the reconstruction of evolutionary relationships between organisms, genes, and gene families. Maximum likel...
Thomas M. Keane, Andrew J. Page, Thomas J. Naughto...
ENTCS
2008
120views more  ENTCS 2008»
14 years 10 months ago
Specifying and Executing Reactive Scenarios With Lutin
This paper presents the language Lutin and its operational semantics. This language specifically targets the domain of reactive systems, where an execution is a (virtually) infini...
Pascal Raymond, Yvan Roux, Erwan Jahier
ENTCS
2008
64views more  ENTCS 2008»
14 years 10 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader
CORR
2004
Springer
180views Education» more  CORR 2004»
14 years 10 months ago
Alchemi: A .NET-based Grid Computing Framework and its Integration into Global Grids
: Computational grids that couple geographically distributed resources are becoming the de-facto computing platform for solving large-scale problems in science, engineering, and co...
Akshay Luther, Rajkumar Buyya, Rajiv Ranjan, Sriku...