Sciweavers

417 search results - page 9 / 84
» In Search of the Best Constraint Satisfaction Search
Sort
View
AI
2004
Springer
15 years 3 months ago
Constraint Satisfaction Methods for Information Personalization
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
Syed Sibte Raza Abidi, Yong Han Chong
TIME
2002
IEEE
15 years 2 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
SAC
2009
ACM
15 years 4 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
72
Voted
CORR
2010
Springer
117views Education» more  CORR 2010»
14 years 9 months ago
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpos...
Thanasis Balafoutis, Kostas Stergiou
CP
2009
Springer
15 years 4 months ago
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
Serdar Kadioglu, Meinolf Sellmann