Sciweavers

1603 search results - page 53 / 321
» Multi-Dimensional Heuristic Searching
Sort
View
AIPS
2010
15 years 2 months ago
The Joy of Forgetting: Faster Anytime Search via Restarting
Anytime search algorithms solve optimisation problems by quickly finding a usually suboptimal solution and then finding improved solutions when given additional time. To deliver a...
Silvia Richter, Jordan Tyler Thayer, Wheeler Ruml
CEC
2007
IEEE
15 years 6 months ago
An investigation of hyper-heuristic search spaces
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
José Antonio Vázquez Rodrígue...
CP
2007
Springer
15 years 6 months ago
An LP-Based Heuristic for Optimal Planning
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
Menkes van den Briel, J. Benton, Subbarao Kambhamp...
IJCNN
2006
IEEE
15 years 5 months ago
A Heuristic for Free Parameter Optimization with Support Vector Machines
— A heuristic is proposed to address free parameter selection for Support Vector Machines, with the goals of improving generalization performance and providing greater insensitiv...
Matthew Boardman, Thomas P. Trappenberg
ICML
2007
IEEE
16 years 19 days ago
Best of both: a hybridized centroid-medoid clustering heuristic
Although each iteration of the popular kMeans clustering heuristic scales well to larger problem sizes, it often requires an unacceptably-high number of iterations to converge to ...
Nizar Grira, Michael E. Houle