Algorithm design by successive transformation
Abstract
References
Index Terms
- Algorithm design by successive transformation
Recommendations
Algorithm design by successive transformation
Algorithms courses are typically organized either by application area or by design technique. Each of these organizations has its strength, but neither effectively reflects the fact that sophisticated algorithms are not designed in a single pass. This ...
A parallel algorithm for finding all successive minimal maximum subsequences
LATIN'06: Proceedings of the 7th Latin American conference on Theoretical InformaticsEfficient algorithms for finding multiple contiguous subsequences of a real-valued sequence having large cumulative sums, in addition to its combinatorial appeal, have widely varying applications such as in textual information retrieval and ...
Generalized von Neumann-Kakutani transformation and random-start scrambled Halton sequences
It is a well-known fact that the Halton sequence exhibits poor uniformity in high dimensions. Starting with Braaten and Weller in 1979, several researchers introduced permutations to scramble the digits of the van der Corput sequences that make up the ...
Comments
Information & Contributors
Information
Published In
Publisher
Consortium for Computing Sciences in Colleges
Evansville, IN, United States
Publication History
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 169Total Downloads
- Downloads (Last 12 months)11
- Downloads (Last 6 weeks)5
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in