1632 search results - page 94 / 327 » Sublinear Time Algorithms for Metric Space Problems |
115
Voted
SWAT
1998
Springer
15 years 7 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
116
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
131
Voted
SBACPAD
2005
IEEE
15 years 9 months ago
2005
IEEE
The time required to simulate a complete benchmark program using the cycle-accurate model of a microprocessor can be prohibitively high. One of the proposed methodologies, represe...
125
Voted
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
184
Voted
DBA
2006
15 years 5 months ago
2006
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...