778 search results - page 72 / 156 » Bounding Smooth Integers |
100
click to vote
JSC
2006
15 years 3 months ago
2006
Consider the class of exp-log constants, which is constructed from the integers using the field operations, exponentiation and logarithm. Let z be such an exp-log constant and let...
105
click to vote
IPL
2002
15 years 2 months ago
2002
This note reports on the number of s-partitions of a natural number n. In an s-partition of n each cell has the form 2k - 1 for some integer k. Such partitions have potential appl...
146
click to vote
COCOA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. For a fixed integer k 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls",...
149
click to vote
SWAT
2010
Springer
15 years 28 days ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
124
click to vote
ISAAC
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...