Differences in working memory capacity (WMC) relate to performance on a variety of problem solving tasks. High WMC is beneficial for solving analytical problems, but can hinder performance on insight problems (DeCaro & Beilock, 2010). One suggested reason for WMC-related differences in problem solving performance is differences in strategy selection, in which high WMC individuals tend toward co...

In this paper, we consider the k-center problem for streaming points in Rd. More precisely, we consider the single-pass streaming model, where each point in the stream is allowed to be examined only once and a small amount of information can be stored in a device. Since the size of memory is much smaller than the size of the data in the streaming model, it is important to develop an algorithm w...

In this paper, we consider the problem of computing the algebraic parametric equation of the Euclidean 1-center function in R, d ≥ 2, for a system of n static points and m mobile points having motion defined by rational parametric functions. We have shown that the corresponding Euclidean 1-center function is a piecewise differentiable function and have derived its exact parametric algebraic equ...

Design and simulation environments are tools offering contrasted benefits for discovery learning in multiple domains. However, when these domains are complex the problems that the students have to solve during their learning justify the necessity to carry out the design activity itself in groups. From the perspective of modelling and simulation in collaboration, we present DomoSim-TPC, a system...

We study the problem of allocating memory of servers in a data center based on online requests for storage. Given an online sequence of storage requests and a cost associated with serving the request by allocating space on a certain server one seeks to select the minimum number of servers as to minimize total cost. We use two different algorithms and propose a third algorithm. We show that our ...

We generalize the Euclidean 1-center approximation algorithm of Bădoiu and Clarkson (2003) to arbitrary Riemannian geometries, and study the corresponding convergence rate. We then show how to instantiate this generic algorithm to two particular settings: (1) the hyperbolic geometry, and (2) the Riemannian manifold of symmetric positive definite matrices.

In an inverse network absolute (or vertex) 1-center location problem the parameters of a given network, like edge lengths or vertex weights, have to be modified at minimum total cost such that a prespecified vertex s becomes an absolute (or a vertex) 1-center of the network. In this article, the inverse absolute and vertex 1-center location problem on trees with n + 1 vertices is considered whe...

We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorithm computes a 3/2-factor approximation in any dimension using minimum space in just one pass over the data points.

In this paper, we consider a coverage problem for uncertain points in a tree. Let T be a tree containing a set P of n (weighted) demand points, and the location of each demand point Pi ∈ P is uncertain but is known to appear in one of mi points on T each associated with a probability. Given a covering range λ, the problem is to find a minimum number of points (called centers) on T to build faci...

Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model....