Abstract. In an application where autonomous robots can amalgamate spontaneously into arbitrary organisms, the individual robots cannot know a priori at which location in an organi...
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
— Emerging uncertain database applications often involve the cleansing (conditioning) of uncertain databases using additional information as new evidence for reducing the uncerta...
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...