We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
Daniel W. Engels, Jon Feldman, David R. Karger, Ma...
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Synthesis of textures is a very popular and active area of research; the applications and the areas of interest are various and significant. In the last years, much work has been ...
Thefocus of this workis the computationof efficient strategies for commoditytrading in a multi-marketenvironment. In today's "global economy"commodities are often b...
Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochanta...
The paper studies empirically the time-space trade-off between sampling and inference in the cutset sampling algorithm. The algorithm samples over a subset of nodes in a Bayesian ...