1707 search results - page 163 / 342 » Early Integer Programming |
125
click to vote
FOSSACS
2011
Springer
14 years 6 months ago
2011
Springer
Dependently typed programs contain an excessive amount of static terms which are necessary to please the type checker but irrelevant for computation. To obtain reasonable performan...
105
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
121
click to vote
CGO
2003
IEEE
15 years 7 months ago
2003
IEEE
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...
100
click to vote
ISSRE
2002
IEEE
15 years 7 months ago
2002
IEEE
Fault insertion based techniqueshave been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating m...
COR
2008
15 years 2 months ago
2008
Investment in landscapes to achieve outcomes that have multiple environmental benefits has become a major priority in many countries. This gives rise to opportunities for mathemat...