Sciweavers

341 search results - page 11 / 69
» Redundancy elimination revisited
Sort
View
IJAR
2010
98views more  IJAR 2010»
13 years 4 months ago
Variable elimination for influence diagrams with super value nodes
In the original formulation of influence diagrams (IDs), each model contained exactly one utility node. Tatman and Shachter (1990), introduced the possibility of having super-valu...
Manuel Luque, Francisco Javier Díez
CIE
2008
Springer
13 years 9 months ago
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
We revisit Girard's reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called eliminati...
Colin Riba
BMCBI
2011
13 years 2 months ago
RedundancyMiner: De-replication of redundant GO categories in microarray and proteomics analysis
Background: The Gene Ontology (GO) Consortium organizes genes into hierarchical categories based on biological process, molecular function and subcellular localization. Tools such...
Barry Zeeberg, Hongfang Liu, Ari B. Kahn, Martin E...
INTEGRATION
2008
191views more  INTEGRATION 2008»
13 years 7 months ago
Constant-time addition with hybrid-redundant numbers: Theory and implementations
Abstract: Hybrid-redundant number representation has provided a flexible framework for digitparallel addition in a manner that facilitates area-time tradeoffs for VLSI implementati...
Ghassem Jaberipur, Behrooz Parhami
CADE
1992
Springer
13 years 11 months ago
Caching and Lemmaizing in Model Elimination Theorem Provers
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
Owen L. Astrachan, Mark E. Stickel