We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
An open problem in multiobjective optimization using the Pareto optimality criteria, is how to evaluate the performance of different evolutionary algorithms that solve multi– o...
This paper is concerned with developing an information-theoretic framework to aggregate the state space of a Hidden Markov Model (HMM) on discrete state and observation spaces. The...