6105 search results - page 974 / 1221 » A Parallel Algorithm for Bound-Smoothing |
171
click to vote
ICDCSW
2009
IEEE
16 years 1 months ago
2009
IEEE
We introduce a dynamic battery model that describes the variations of the capacity of a battery under time varying discharge current. This model supports a co-design approach for ...
241
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— Scan matching, the problem of registering two laser scans in order to determine the relative positions from which the scans were obtained, is one of the most heavily relied-upo...
166
click to vote
IEEECGIV
2009
IEEE
16 years 1 months ago
2009
IEEE
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
191
click to vote
ADMA
2009
Springer
16 years 1 months ago
2009
Springer
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...
198
click to vote
WFLP
2009
Springer
16 years 1 months ago
2009
Springer
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...