Sciweavers

778 search results - page 72 / 156
» Bounding Smooth Integers
Sort
View
JSC
2006
102views more  JSC 2006»
13 years 7 months ago
Counterexamples to witness conjectures
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...
Joris van der Hoeven
IPL
2002
60views more  IPL 2002»
13 years 7 months ago
s-partitions
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...
William M. Y. Goh, Pawel Hitczenko, Ali Shokoufand...
COCOA
2010
Springer
13 years 5 months ago
Coverage with k-Transmitters in the Presence of Obstacles
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",...
Brad Ballinger, Nadia Benbernou, Prosenjit Bose, M...
SWAT
2010
Springer
294views Algorithms» more  SWAT 2010»
13 years 5 months ago
Bin Packing with Fixed Number of Bins Revisited
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...
Klaus Jansen, Stefan Kratsch, Dániel Marx, ...
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
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 ...
Jinhui Xu, Lei Xu, Yulai Xie