Management Science, Vol. 34, No. 3, Focussed Issue on Heuristics (Mar., 1988), pp. 402-410 (9 pages) A new approximate algorithm for multidimensional zero-one knapsack problems with all positive ...

Abstract: We study approximate algorithms for document placement in distributed Web servers in this paper. With a set S of documents as input, we first give an approximate algorithm for document ...

Abstract: In modern database applications the similarity or dissimilarity of complex objects is examined by performing distance-based queries (DBQs) on data of high dimensionality. The R-tree and its ...

Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with content, and download exclusive resources. Vivek Yadav, an engineering manager from ...

This repository contains universal implementations of three algorithms for approximating projection depths in multivariate statistics: Random Search, Refined Random Search, and Spherical Nelder-Mead.

A monthly overview of things you need to know as an architect or aspiring architect. Unlock the full InfoQ experience by logging in! Stay updated with your favorite authors and topics, engage with ...

Real-time Interactive Barnes-Hut N-Body Simulator. Create galaxies, apply forces, visualize spatial partitioning, parameterize simulation physics and entities, etc.

In this paper, we consider the scheduling problem of minimising the total weighted job completion time when a set of jobs must be processed on m parallel machines with a single server. This problem ...