Sciweavers

8780 search results - page 147 / 1756
» On the Feasibility of Consistent Computations
Sort
View
ATAL
2010
Springer
15 years 8 months ago
Closing the learning-planning loop with predictive state representations
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 ...
Byron Boots, Sajid M. Siddiqi, Geoffrey J. Gordon
AMAI
2006
Springer
15 years 7 months ago
Computational methods for database repair by signed formulae
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...
ICMS
2010
15 years 5 months ago
Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases
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...
Bettina Eick, Max Horn
178
Voted
ICRA
2002
IEEE
123views Robotics» more  ICRA 2002»
15 years 12 months ago
Computing Wrench Cones for Planar Contact Tasks
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...
CEC
2005
IEEE
16 years 20 days ago
Linear equality constraints and homomorphous mappings in PSO
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...
Christopher K. Monson, Kevin D. Seppi