5493 search results - page 233 / 1099 » Effectively Polynomial Simulations |
141
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the sli...
166
click to vote
IJCAI
2007
15 years 8 months ago
2007
Abstract. In this paper, nogood recording is investigated for CSP within the randomization and restart framework. Our goal is to avoid the same situations to occur from one run to ...
288
click to vote
SNPD
2004
15 years 8 months ago
2004
We proposed a new approach to compare profiles when the correlations among attributes can be represented as a tree. To account for these correlations, the profile is extended with...
164
click to vote
IJCAI
2003
15 years 8 months ago
2003
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
165
click to vote
AAAI
2000
15 years 8 months ago
2000
We present a new algorithm that reduces the space complexity of heuristic search. It is most effective for problem spaces that grow polynomially with problem size, but contain lar...