Sciweavers

4117 search results - page 181 / 824
» On the Satisfiability of Complex Constraints
Sort
View
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 6 months ago
Implementing general belief function framework with a practical codification for low complexity
In this chapter, we propose a new practical codification of the elements of the Venn diagram in order to easily manipulate the focal elements. In order to reduce the complexity, t...
Arnaud Martin
CP
2007
Springer
16 years 22 days ago
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder,...
CSR
2007
Springer
16 years 22 days ago
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
VLDB
1993
ACM
121views Database» more  VLDB 1993»
15 years 10 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis
ICRA
2006
IEEE
81views Robotics» more  ICRA 2006»
16 years 18 days ago
Uncertainty Ellipsoids Calculations for Complex 3D Reconstructions
— Many methods exist for the automatic and optimal 3D reconstruction of camera motion and scene structure from image sequence (’Structure from Motion‘ or SfM). The solution t...
Maxime Lhuillier, Mathieu Perriollat