Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of...
This paper challenges the generic single conceptual viewpoint that designers have of groupware and specifically Groupware Calendar Systems (GCS). From the analysis of interviews, ...
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
—This paper deals with distributed beamforming techniques for wireless networks with half-duplex amplify-andforward relays. Existing schemes optimize the beamforming weights base...
This paper considers a portfolio selection problem with type-2 fuzzy future returns involving ambiguous and subjectivity. Since this proposed problem is not well-defined due to fuz...