216 search results - page 16 / 44 » Fast Optimal Algorithms for Computing All the Repeats in a S... |
AIPS
2010
13 years 11 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
ICCSA
2005
Springer
14 years 2 months ago
2005
Springer
Various global optimization methods are compared in order to find the best strategy to solve realistic drag reduction problems in the automotive industry. All the methods consist ...
VLDB
1987
ACM
14 years 2 days ago
1987
ACM
Beginning to create the New Oxford English Dictionary database has resulted in the realization that databases for reference texts are unlike those for conventional enterprises. Wh...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
: Many high performance computing algorithms are bandwidth limited, hence the need for optimal data rearrangement kernels as well as their easy integration into the rest of the app...
ICCAD
2008
IEEE
14 years 5 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...