6514 search results - page 1201 / 1303 » Low-Knowledge Algorithm Control |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
KDD
2000
ACM
15 years 1 months ago
2000
ACM
To improve the accuracy in terms of precision and recall of an audio information retrieval system we have created a domainspecific ontology (a collection of key concepts and their...
106
click to vote
ISTCS
1992
Springer
15 years 1 months ago
1992
Springer
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...