14 papers:
- DAC-2013-FattahDLP #agile #manycore
- Smart hill climbing for agile dynamic mapping in many-core systems (MF, MD, PL, JP), p. 6.
- ITiCSE-2011-BlevinsKMMS #game studies
- Muddy hill games (JB, AK, EM, EMS, ES), p. 395.
- ICPR-2010-RathgebU #performance #recognition
- Attacking Iris Recognition: An Efficient Hill-Climbing Technique (CR, AU), pp. 1217–1220.
- SAC-2010-Kavallieratou #detection #segmentation
- Text line detection and segmentation: uneven skew angles and hill-and-dale writing (EK), pp. 59–60.
- ISSTA-2007-HarmanM #empirical #generative #testing
- A theoretical & empirical znalysis of evolutionary testing and hill climbing for structural test data generation (MH, PM), pp. 73–83.
- SAC-2005-ValigianiBJLBC
- Experimenting with a real-size man-hill to optimize pedagogical paths (GV, RB, YJ, EL, CBR, PC), pp. 4–8.
- ICML-2004-CastilloW #case study #comparative #learning #multi
- A comparative study on methods for reducing myopia of hill-climbing search in multirelational learning (LPC, SW).
- ICPR-v2-2004-FarmerBJ #feature model #random #scalability #using
- Large Scale Feature Selection Using Modified Random Mutation Hill Climbing (MEF, SB, AKJ), pp. 287–290.
- ICSM-2003-MahdaviHH #approach #clustering #multi
- A Multiple Hill Climbing Approach to Software Module Clustering (KM, MH, RMH), pp. 315–324.
- SIGIR-2000-Papadias #algorithm #retrieval
- Hill climbing algorithms for content-based retrieval of similar configurations (DP), pp. 240–247.
- ICML-1995-KimuraYK #learning #probability
- Reinforcement Learning by Stochastic Hill Climbing on Discounted Reward (HK, MY, SK), pp. 295–303.
- ICML-1995-Lang95a #problem #search-based #synthesis
- Hill Climbing Beats Genetic Search on a Boolean Circuit Synthesis Problem of Koza’s (KJL), pp. 340–343.
- ICML-1994-Skalak #algorithm #feature model #prototype #random
- Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms (DBS), pp. 293–301.
- ML-1988-RoseL #approach
- A Hill-Climbing Approach to Machine Discovery (DR, PL), pp. 367–373.