472 search results - page 47 / 95 » Design of Iterated Local Search Algorithms |
DAGSTUHL
2004
14 years 11 months ago
2004
Subgroup discovery aims at finding interesting subsets of a classified example set that deviates from the overall distribution. The search is guided by a so-called utility function...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
JCO
1998
14 years 9 months ago
1998
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
120
click to vote
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Nowadays, object recognition is widely studied under the paradigm of matching local features. This work describes a genetic programming methodology that synthesizes mathematical e...
AIRWEB
2008
Springer
14 years 11 months ago
2008
Springer
Since the link structure of the web is an important element in ranking systems on search engines, web spammers widely use the link structure of the web to increase the rank of the...