693 search results - page 60 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
IAT
2009
IEEE
13 years 12 months ago
2009
IEEE
Variants of the decentralized MDP model focus on problems exhibiting some special structure that makes them easier to solve in practice. Our work is concerned with two main issues...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
ITC
2002
IEEE
14 years 1 months ago
2002
IEEE
The advantage to “one test at a time” fault diagnosis is its ability to implicate the components of complicated defect behaviors. The disadvantage is the large size and opacit...
JBI
2004
13 years 9 months ago
2004
Microarray analysis using clustering algorithms can suffer from lack of inter-method consistency in assigning related gene-expression profiles to clusters. Obtaining a consensus s...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....