6110 search results - page 106 / 1222 » Approximate Computing |
162
click to vote
RECOMB
2006
Springer
16 years 6 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
192
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
152
click to vote
GECCO
2009
Springer
16 years 26 days ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
157
click to vote
IROS
2007
IEEE
16 years 18 days ago
2007
IEEE
— Smoothing and optimization approaches are an effective means for solving the simultaneous localization and mapping (SLAM) problem. Most of the existing techniques focus mainly ...
164
click to vote
FORMATS
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...