Sciweavers

13457 search results - page 105 / 2692
» Can we elect if we cannot compare
Sort
View
WDAG
2005
Springer
74views Algorithms» more  WDAG 2005»
14 years 2 months ago
On the Availability of Non-strict Quorum Systems
Abstract. Allowing read operations to return stale data with low probability has been proposed as a means to increase availability in quorums systems. Existing solutions that allow...
Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi
BMCBI
2010
152views more  BMCBI 2010»
13 years 9 months ago
Comparative study of discretization methods of microarray data for inferring transcriptional regulatory networks
Background: Microarray data discretization is a basic preprocess for many algorithms of gene regulatory network inference. Some common discretization methods in informatics are us...
Yong Li, Lili Liu, Xi Bai, Hua Cai, Wei Ji, Dianji...
AIM
2006
13 years 9 months ago
Comparative Analysis of Frameworks for Knowledge-Intensive Intelligent Agents
maintain awareness of its environment for a long period of time. Additionally, knowledge-intensive agents must be engineered such that their knowledge can be easily updated as envi...
Randolph M. Jones, Robert E. Wray III
CORR
1998
Springer
84views Education» more  CORR 1998»
13 years 8 months ago
Comparing a statistical and a rule-based tagger for German
In this paper we present the results of comparing a statistical tagger for German based on decision trees and a rule-based Brill-Tagger for German. We used the same training corpu...
Martin Volk, Gerold Schneider
BMCBI
2008
155views more  BMCBI 2008»
13 years 9 months ago
ComPath: comparative enzyme analysis and annotation in pathway/subsystem contexts
Background: Once a new genome is sequenced, one of the important questions is to determine the presence and absence of biological pathways. Analysis of biological pathways in a ge...
Kwangmin Choi, Sun Kim