Searching for "Random Descent." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

42 documents found, showing 1 through 10. Next 10 →

Perceptron learning with random coordinate descent
by Ling Li — 2005 — California Institute of Technology
…Perceptron Learning with Random Coordinate Descent Ling Li Learning Systems Group, California…
Cited by 6 (3 self) – Add To MetaCart

An Investigation Of Variable Neighbourhood Search For University Course Timetabling
by Salwani Abdullah, Edmund K. Burke, Barry Mccollum — 2005 — in The 2 nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA
… with an exponential monte carlo acceptance criteria. This heuristic search approach is based on random-descent local…
Cited by 6 (4 self) – Add To MetaCart

The shape of the processor design space and its implications for early stage explorations
by Stijn Eyerman, Lieven Eeckhout, Koen De Bosschere — 2005 — In Proc. 7th WSEAS International Conference on Automatic Control, Modeling and Simulation
… studies. Four design space search algorithms (random descent, steepest descent, one…
Cited by 4 (0 self) – Add To MetaCart

A Probabilistic Roadmap Approach for Systems with Closed Kinematic Chains
by Steven M. Lavalle, Jeffery H. Yakey — 1999 — In Proc. IEEE Int. Conf. Robot. Autom. (ICRA
… randomized gradient descent to force satisfaction of the closure constraints. We gen- erate edges…
Cited by 57 (4 self) – Add To MetaCart

A Memetic Algorithm for University Exam Timetabling
by Edmund K. Burke, James P. Newall, Rupert F. Weare — 1996
… the value of combining local search with the mutation operators in a population a multistart random descent…
Cited by 65 (20 self) – Add To MetaCart

Automated operation minimization of tensor contraction expressions in electronic structure calculations
by Albert Hartono, Er Sibiryakov, Marcel Nooijen, Gerald Baumgartner, David E. Bernholdt, So Hirata, Chi-chung Lam, Russell M. Pitzer, J. Ramanujam — 2005 — In Proc. ICCS 2005 5th International Conference, volume 3514 of Lecture Notes in Computer Science
…. The best algorithm is found to be a random-descent heuristic, which is then used to explore the generated…
Cited by 1 (1 self) – Add To MetaCart

A Parameter-Free Hyperheuristic for Scheduling a Sales Summit
by Peter Cowling, Graham Kendall, Eric Soubeiga — 2001 — Proceedings of the 4th Metaheuristic International Conference, MIC 2001
… neighbourhood at random and applies it once (single call). RandomDescent chooses one neighbourhood at random…
Cited by 18 (9 self) – Add To MetaCart

A Parameter-Free Hyperheuristic for Scheduling a Sales Summit
by Sales Summit, Peter Cowling, Graham Kendall, Eric Soubeiga — 2001
… neighbourhood at random and applies it once (single call). RandomDescent chooses one neighbourhood at random…
Add To MetaCart

Efficient design space exploration of high performance embedded outof-order processors
by Stijn Eyerman, Lieven Eeckhout, Koen De Bosschere — 2006 — In Design, Automation, and Test in Europe
… in the context of electronic design, such as random descent, steepest descent (hill climbing) [14], one…
Cited by 8 (1 self) – Add To MetaCart

An experimental study on hyper-heuristics and exam timetabling
by Burak Bilgin, Ender Özcan, Emin Erkan Korkmaz — 2006 — Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling
… mechanism chooses a low level heuristic at a time randomly. Random Descent mechanism chooses a low level…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB