Sciweavers

778 search results - page 94 / 156
» Bounding Smooth Integers
Sort
View
CPAIOR
2005
Springer
14 years 1 months ago
A Search-Infer-and-Relax Framework for Integrating Solution Methods
Abstract. We present an algorithmic framework for integrating solution methods that is based on search, inference, and relaxation and their interactions. We show that the following...
John N. Hooker
ICALP
2005
Springer
14 years 1 months ago
Dynamic Bin Packing of Unit Fractions Items
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
Wun-Tat Chan, Tak Wah Lam, Prudence W. H. Wong
SAS
2005
Springer
14 years 1 months ago
A Generic Framework for Interprocedural Analysis of Numerical Properties
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
Markus Müller-Olm, Helmut Seidl
WCC
2005
Springer
140views Cryptology» more  WCC 2005»
14 years 1 months ago
Constructions of Complementary Sequences for Power-Controlled OFDM Transmission
We present constructions of polyphase sequences suitable for the use as codewords in orthogonal frequency-division multiplexing (OFDM) with strictly bounded peak-to-mean envelope p...
Kai-Uwe Schmidt, Adolf Finger
ANTS
2004
Springer
233views Algorithms» more  ANTS 2004»
14 years 1 months ago
Computing Order Statistics in the Farey Sequence
We study the problem of computing the k-th term of the Farey sequence of order n, for given n and k. Several methods for generating the entire Farey sequence are known. However, th...
Corina E. Patrascu, Mihai Patrascu