This paper presents a method that combines Mutual Information and k-Nearest Neighbors approximator for time series prediction. Mutual Information is used for input selection. K-Nea...
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...