2976 search results - page 345 / 596 » On the bounded integer programming |
116
click to vote
ACISP
2010
Springer
15 years 6 months ago
2010
Springer
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
138
click to vote
PDPTA
2003
15 years 6 months ago
2003
Common binary arithmetic operations such as addition/subtraction and multiplication suffer from O(n) carry propagation delay where n is the number of digits. Carry lookahead helps...
110
Voted
IPCO
1996
15 years 6 months ago
1996
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
143
click to vote
IJCAI
1989
15 years 5 months ago
1989
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
141
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...