Sciweavers

109 search results - page 11 / 22
» Variable symmetry breaking in numerical constraint problems
Sort
View
100
Voted
AMAI
2005
Springer
15 years 14 days ago
A SAT approach to query optimization in mediator systems
Mediator systems integrate distributed, heterogeneous and autonomous data sources, but their e ective use requires the solution of hard query optimization problems. This is usuall...
Steven David Prestwich, Stéphane Bressan
AISC
2008
Springer
15 years 2 months ago
The Monoids of Order Eight and Nine
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
Andreas Distler, Tom Kelsey
103
Voted
CVPR
2000
IEEE
16 years 2 months ago
A General Method for Errors-in-Variables Problems in Computer Vision
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
Bogdan Matei, Peter Meer
98
Voted
JGO
2008
90views more  JGO 2008»
15 years 16 days ago
A scaling algorithm for polynomial constraint satisfaction problems
Abstract. Good scaling is an essential requirement for the good behavior of many numerical algorithms. In particular, for problems involving multivariate polynomials, a change of s...
Ferenc Domes, Arnold Neumaier
72
Voted
AAAI
2007
15 years 2 months ago
Transposition Tables for Constraint Satisfaction
In this paper, a state-based approach for the Constraint Satisfaction Problem (CSP) is proposed. The key novelty is an original use of state memorization during search to prevent ...
Christophe Lecoutre, Lakhdar Sais, Sébastie...