1264 search results - page 70 / 253 » The framework approach for constraint satisfaction |
165
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Given a user in a social network, which new friends should we recommend, the dual goal being to achieve user satisfaction and good network connectivity? Similarly, which new produc...
155
click to vote
IJCAI
2007
15 years 7 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
176
Voted
AIPS
2003
15 years 7 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
160
click to vote
ACL
2001
15 years 7 months ago
2001
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
186
click to vote
CP
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...