693 search results - page 17 / 139 » Complexity Analysis of Heuristic CSP Search Algorithms |
132
click to vote
FLAIRS
2004
15 years 3 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
120
click to vote
IJCNN
2006
IEEE
15 years 7 months ago
2006
IEEE
— A heuristic is proposed to address free parameter selection for Support Vector Machines, with the goals of improving generalization performance and providing greater insensitiv...
109
click to vote
GECCO
2005
Springer
15 years 7 months ago
2005
Springer
A need for solving more and more complex problems drives the Evolutionary Computation community towards advanced models of Evolutionary Algorithms. One such model is the island mo...
ICGI
1998
Springer
15 years 6 months ago
1998
Springer
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
139
Voted
ICPADS
2007
IEEE
15 years 8 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...