相关论文: Analysis of the Harmonic Function Used in Bin-Pack…
We present new approximation schemes for bin packing based on the following two approaches: (1) partitioning the given problem into mostly identical sub-problems of constant size and then construct a solution by combining the solutions of…
We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing. We uncover incompletenesses in existing…
This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which considers the presence of uncertain scenarios, of which only one is realized. For…
The Bayesian Block algorithm, originally developed for applications in astronomy, can be used to improve the binning of histograms in high energy physics. The visual improvement can be dramatic, as shown here with two simple examples. More…
The monotone rearrrangement algorithm was introduced by Hardy, Littlewood and P\'olya as a sorting device for functions. Assuming that $x$ is a monotone function and that an estimate $x_n$ of $x$ is given, consider the monotone…
In the present work, an attempted was made to develop a numerical algorithm by the use of new orthogonal hybrid functions formed from hybrid of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal…
Recent work by McClarren & Hauck [29] suggests that the filtered spherical harmonics method represents an efficient, robust, and accurate method for radiation transport, at least in the two-dimensional (2D) case. We extend their work to the…
We consider spaces for which there is a notion of harmonicity for complex valued functions defined on them. For instance, this is the case of Riemannian manifolds on one hand, and (metric) graphs on the other hand. We observe that it is…
Conceptual blending is a powerful tool for computational creativity where, for example, the properties of two harmonic spaces may be combined in a consistent manner to produce a novel harmonic space. However, deciding about the importance…
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. It is remarkable both for its simplicity and for its excellent performance in practice. The "magic" of pairing heaps lies in…
A new characterization of harmonic functions is obtained. It is based on quadrature identities involving mean values over annular domains and over concentric spheres lying within these domains or on their boundaries. The analogous result…
Best Fit is a well known online algorithm for the bin packing problem, where a collection of one-dimensional items has to be packed into a minimum number of unit-sized bins. In a seminal work, Kenyon [SODA 1996] introduced the (asymptotic)…
We give a survey of recent joint work with E. M. Stein (Princeton University) concerning the application of suitable versions of the T(1)-theorem technique to the study of orthogonal projections onto the Hardy and Bergman spaces of…
Kernel-based methods have been recently introduced for linear system identification as an alternative to parametric prediction error methods. Adopting the Bayesian perspective, the impulse response is modeled as a non-stationary Gaussian…
A new method to compute the incoherent scattering function of harmonic lattices is introduced. It is based in a saddle point approximation for each term of the phonon expansion, and is simple enough to be used in practice. The method gives…
In this note, we extend the definition of multiple harmonic sums and apply their stuffle relations to obtain explicit evaluations of the sums $R_n(p,t)=\sum\nolimits_{m=0}^n m^p H_m^t$, where $H_m$ are harmonic numbers. When $t\le 4$ these…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
To avoid problems with infinite measure, the functional integral for harmonic oscillator can be calculated by time - slicing method with continuum limit procedure proposed Gelfand and Yaglom. In previous article we proved by nonperturbative…
In this paper we present a fast scalable heuristic for bin packing that partitions the given problem into identical sub-problems of constant size and solves these constant size sub-problems by considering only a constant number of bin…
Consolidation of loose packages into transport units is a fundamental activity offered by logistics service-providers. Moving the transport units instead of loose packages is faster (with one movement only, multiple packages are loaded…