1921 search results - page 168 / 385 » Making AC-3 an Optimal Algorithm |
120
Voted
AAAI
2004
15 years 3 months ago
2004
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
109
click to vote
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Feature extraction and classification are two important components in pattern recognition. In this paper, we propose dynamic target classification in WSNs. The main idea of this a...
123
click to vote
LPAR
2005
Springer
15 years 8 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
102
click to vote
AAAI
2008
15 years 4 months ago
2008
This paper presents a fast simulated annealing framework for combining multiple clusterings (i.e. clustering ensemble) based on some measures of agreement between partitions, whic...
147
click to vote
JMLR
2006
15 years 2 months ago
2006
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...