Sciweavers

113 search results - page 11 / 23
» A new Approach for Solving Satisfiability Problems with Qual...
Sort
View
TROB
2008
168views more  TROB 2008»
13 years 7 months ago
A Minimalistic Approach to Appearance-Based Visual SLAM
This paper presents a vision-based approach to SLAM in indoor / outdoor environments with minimalistic sensing and computational requirements. The approach is based on a graph repr...
Henrik Andreasson, Tom Duckett, Achim J. Lilientha...
AAAI
2006
13 years 9 months ago
Model Counting: A New Strategy for Obtaining Good Bounds
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
Carla P. Gomes, Ashish Sabharwal, Bart Selman
IWC
2007
120views more  IWC 2007»
13 years 7 months ago
Visualizing set concordance with permutation matrices and fan diagrams
Scientific problem solving often involves concordance (or discordance) analysis among the result sets from different approaches. For example, different scientific analysis met...
Bo Hyoung Kim, Bongshin Lee, Jinwook Seo
IJCV
2006
120views more  IJCV 2006»
13 years 7 months ago
Contour Inferences for Image Understanding
We present a new approach to the algorithmic study of planar curves, with applications to estimations of contours in images. We construct spaces of curves satisfying constraints su...
Washington Mio, Anuj Srivastava, Xiuwen Liu
PRICAI
1998
Springer
13 years 12 months ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar