914 search results - page 133 / 183 » Informative performance metrics for dynamic optimisation pro... |
ICRA
2002
IEEE
15 years 4 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
111
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
109
click to vote
PPOPP
1999
ACM
15 years 4 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
119
click to vote
CF
2007
ACM
15 years 3 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
121
click to vote
ICSE
2001
IEEE-ACM
15 years 4 months ago
2001
IEEE-ACM
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...