693 search results - page 39 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
145
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
113
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
142
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
128
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
152
click to vote
DAM
1999
15 years 3 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...