Sciweavers

73 search results - page 7 / 15
» A Landscape Analysis of Constraint Satisfaction Problems
Sort
View
CPAIOR
2008
Springer
14 years 11 months ago
Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...
Ivan Heckman, J. Christopher Beck
GLOBECOM
2008
IEEE
15 years 4 months ago
Guaranteed Boxed Localization in MANETs by Interval Analysis and Constraints Propagation Techniques
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...
Farah Mourad, Hichem Snoussi, Fahed Abdallah, C&ea...
DSS
2007
113views more  DSS 2007»
14 years 9 months ago
An associate constraint network approach to extract multi-lingual information for crime analysis
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
Christopher C. Yang, Kar Wing Li
CORR
2008
Springer
76views Education» more  CORR 2008»
14 years 10 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
CISSE
2008
Springer
14 years 11 months ago
From Constraints to Resolution Rules Part I : conceptual framework
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
Denis Berthier