A central problem in artificial intelligence is to choose actions to maximize reward in a partially observable, uncertain environment. To do so, we must learn an accurate model of ...
We introduce a simple and practical method for repairing inconsistent databases. Given a possibly inconsistent database, the idea is to properly represent the underlying problem, i...
Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Mau...
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
The successful execution of any contact task fundamentally requires the application of wrenches (forces and moments) consistent with the task. We develop an algorithm for computin...
Devin J. Balkcom, Jeffrey C. Trinkle, E. J. Gottli...
We present a homomorphous mapping that converts problems with linear equality constraints into fully unconstrained and lower-dimensional problems for optimization with PSO. This ap...