3750 search results - page 446 / 750 » Code Optimization for Code Compression |
169
click to vote
EPIA
1999
Springer
15 years 8 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the first modeling language to combine high-level algebraic and set notation...
169
click to vote
ICPP
1991
IEEE
15 years 8 months ago
1991
IEEE
Data decomposition is probably the most successful method for generating parallel programs. In this paper a general framework is described for the automatic generation of parallel...
105
click to vote
IADIS
2004
15 years 6 months ago
2004
In this paper, we propose an open framework for teachers and lecturers in science, to help them write their pedagogical documents with both static textual parts, and interactive a...
145
click to vote
PR
1998
15 years 4 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
121
click to vote
SAS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...