1197 search results - page 40 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
155
click to vote
UAI
2003
15 years 6 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
293
click to vote
TKDE
2012
13 years 8 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
192
click to vote
AIA
2006
15 years 7 months ago
2006
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
134
click to vote
IJCAI
1993
15 years 6 months ago
1993
This paper introduces GSSS (Genetic State-Space Search). The integration of two general search paradigms — genetic search and state-space-search provides a general framework whi...
149
click to vote
SIAMDM
2008
15 years 5 months ago
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...