The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represe...
Darse Billings, Neil Burch, Aaron Davidson, Robert...
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
Seven panelists, all simulation consultants, give their view of the future of simulation. There is some consistency in the views with four areas being mentioned by three of the pa...