84 search results - page 15 / 17 » Comparing results of 31 algorithms from the black-box optimi... |
ISNN
2011
Springer
12 years 8 months ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
BMCBI
2011
12 years 9 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
POPL
2007
ACM
14 years 6 months ago
2007
ACM
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
TJS
2008
13 years 5 months ago
2008
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
CP
2003
Springer
13 years 11 months ago
2003
Springer
This work introduces a combinatorial optimization problem called Mars Express Memory Dumping Problem (Mex-Mdp), which arises in the European Space Agency program Mars Express. It c...