1274 search results - page 125 / 255 » N-fold integer programming |
104
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...
118
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...
99
Voted
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...
129
click to vote
ICALP
2011
Springer
14 years 5 months ago
2011
Springer
Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...