6274 search results - page 873 / 1255 » Proofs, Programs, Processes |
149
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
153
Voted
ECOOP
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. One of the costs of reusing software components is updating applications to use the new version of the components. Updating an application can be error-prone, tedious, an...
135
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
123
Voted
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
134
Voted
ISCA
1998
IEEE
15 years 7 months ago
1998
IEEE
Data compression and prediction are closely related. Thus prediction methods based on data compression algorithms have been suggested for the branch prediction problem. In this wo...