A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an...
We present a time-stepping method to simulate rigid multibody dynamics with inelastic collision, contact, and friction. The method progresses with fixed time step without backtrac...
In this paper it will be explained how to use bitboards for move generation in shogi. In chess, bitboards have been used in most strong programs because of the easy representation...
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...