: In this work we present a strategy for off-line signature verification. It takes into account a writer-independent model which reduces the pattern recognition problem to a 2-clas...
Luiz S. Oliveira, Edson J. R. Justino, Robert Sabo...
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
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 ...
Localization is the process of determining the robot's location within its environment. More precisely, it is a procedure which takes as input a geometric map, a current estim...