These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
75 related articles for article (PubMed ID: 18851188)
1. Divide and concur: a general approach to constraint satisfaction. Gravel S; Elser V Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Sep; 78(3 Pt 2):036706. PubMed ID: 18851188 [TBL] [Abstract][Full Text] [Related]
3. Using Stochastic Spiking Neural Networks on SpiNNaker to Solve Constraint Satisfaction Problems. Fonseca Guerra GA; Furber SB Front Neurosci; 2017; 11():714. PubMed ID: 29311791 [TBL] [Abstract][Full Text] [Related]
4. Complexity of several constraint-satisfaction problems using the heuristic classical algorithm WalkSAT. Guidetti M; Young AP Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Jul; 84(1 Pt 1):011102. PubMed ID: 21867108 [TBL] [Abstract][Full Text] [Related]
5. Method for dense packing discovery. Kallus Y; Elser V; Gravel S Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Nov; 82(5 Pt 2):056707. PubMed ID: 21230619 [TBL] [Abstract][Full Text] [Related]
6. Hierarchical Optimization: Fast and Robust Multiscale Stochastic Reconstructions with Rescaled Correlation Functions. Karsanina MV; Gerke KM Phys Rev Lett; 2018 Dec; 121(26):265501. PubMed ID: 30636118 [TBL] [Abstract][Full Text] [Related]
7. Rigorous location of phase transitions in hard optimization problems. Achlioptas D; Naor A; Peres Y Nature; 2005 Jun; 435(7043):759-64. PubMed ID: 15944693 [TBL] [Abstract][Full Text] [Related]
8. Optimization of batch and fed-batch bioreactors using simulated annealing. Kookos IK Biotechnol Prog; 2004; 20(4):1285-8. PubMed ID: 15296464 [TBL] [Abstract][Full Text] [Related]
9. Fluence map optimization (FMO) with dose-volume constraints in IMRT using the geometric distance sorting method. Lan Y; Li C; Ren H; Zhang Y; Min Z Phys Med Biol; 2012 Oct; 57(20):6407-28. PubMed ID: 22996086 [TBL] [Abstract][Full Text] [Related]
11. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding. Guturu P; Dantu R IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530 [TBL] [Abstract][Full Text] [Related]
12. Folding small proteins via annealing stochastic approximation Monte Carlo. Cheon S; Liang F Biosystems; 2011 Sep; 105(3):243-9. PubMed ID: 21679746 [TBL] [Abstract][Full Text] [Related]
16. Solving multiconstraint assignment problems using learning automata. Horn G; Oommen BJ IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):6-18. PubMed ID: 19884057 [TBL] [Abstract][Full Text] [Related]
17. Solving geometric constraints with genetic simulated annealing algorithm. Liu SL; Tang M; Dong JX J Zhejiang Univ Sci; 2003; 4(5):532-41. PubMed ID: 12958711 [TBL] [Abstract][Full Text] [Related]
18. Continuous extremal optimization for Lennard-Jones clusters. Zhou T; Bai WJ; Cheng LJ; Wang BH Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Jul; 72(1 Pt 2):016702. PubMed ID: 16090129 [TBL] [Abstract][Full Text] [Related]
19. A variable neighborhood Walksat-based algorithm for MAX-SAT problems. Bouhmala N ScientificWorldJournal; 2014; 2014():798323. PubMed ID: 25177732 [TBL] [Abstract][Full Text] [Related]
20. Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem. Seganti A; De Martino A; Ricci-Tersenghi F Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Feb; 89(2):022139. PubMed ID: 25353454 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]