12257 search results - page 7 / 2452 » Analysis of Algorithms |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
SIGCSE
2000
ACM
14 years 6 days ago
2000
ACM
The paper elucidates two views (models) of algorithmic problem solving. The first one is static; it is based on the identification of several principal dimensions of algorithmic p...
CAV
2005
Springer
14 years 1 months ago
2005
Springer
Automaton-based static program analysis has proved to be an effective tool for bug finding. Current tools generally re-analyze a program from scratch in response to a change in t...
DAGSTUHL
1996
13 years 9 months ago
1996
Abstract. Most applications of competitive analysis have involved online problems where a candidate on-line algorithm must compete on some input sequence against an optimal o -line...
TCS
2010
13 years 6 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...