Sciweavers

8838 search results - page 299 / 1768
» Generalizing Domain Theory
Sort
View
CASC
2006
Springer
100views Mathematics» more  CASC 2006»
15 years 10 months ago
Reducing Computational Costs in the Basic Perturbation Lemma
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
Ainhoa Berciano, María José Jim&eacu...
HICSS
2005
IEEE
153views Biometrics» more  HICSS 2005»
16 years 9 days ago
Developing a Knowledge-Based Organizational Performance Model for Discontinuous Participatory Enterprises
Our research seeks to understand how to extend established organization theory and emerging knowledgeflow theory to inform the design of organizations with discontinuous participa...
Rahinah Ibrahim, Mark E. Nissen
TYPES
1998
Springer
15 years 11 months ago
Proof Normalization Modulo
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
Gilles Dowek, Benjamin Werner
ACS
2007
15 years 6 months ago
Algebra and Geometry of Rewriting
We present various results of the last twenty years converging towards a homotopical theory of computation. This new theory is based on two crucial notions : polygraphs (introduce...
Yves Lafont
AI
2007
Springer
15 years 6 months ago
Conservation principles and action schemes in the synthesis of geometric concepts
In this paper a theory for the synthesis of geometric concepts is presented. The theory is focused on a constructive process that synthesizes a function in the geometric domain re...
Luis Alberto Pineda