10890 search results - page 1837 / 2178 » Automatic Complexity Analysis |
216
click to vote
PCI
2005
Springer
16 years 4 days ago
2005
Springer
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic W...
191
click to vote
RULEML
2005
Springer
16 years 3 days ago
2005
Springer
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is useful for many applications in the Semantic W...
228
click to vote
TCGOV
2005
Springer
16 years 3 days ago
2005
Springer
Growing complexity of the data and processes to be managed, as well as the transition from strict governmental regulation towards autonomy make academic institutions a significant ...
193
click to vote
WABI
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. Traditional sequence comparison by alignment applies a mutation model comprising two events, substitutions and indels (insertions or deletions) of single positions (SI). ...
184
Voted
WABI
2005
Springer
16 years 3 days ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...