Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("algorithms")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 251195

  • Page / 10048

Export

Selection :

  • and

Multiple-subarc gradient-restoration algorithm, Part 1: Algorithm structureMIELE, A; WANG, T.Journal of optimization theory and applications. 2003, Vol 116, Num 1, pp 1-17, issn 0022-3239, 17 p.Article

Multiobjective Memetic Algorithms With Quadratic Approximation-Based Local Search for Expensive Optimization in ElectromagneticsWANNER, Elizabeth F; GUIMARIES, Frederico G; TAKAHASHI, Ricardo H. C et al.IEEE transactions on magnetics. 2008, Vol 44, Num 6, pp 1126-1129, issn 0018-9464, 4 p.Conference Paper

On the convergence of a class of estimation of distribution algorithmsQINGFU ZHANG; MÜHLENBEIN, Heinz.IEEE transactions on evolutionary computation. 2004, Vol 8, Num 2, pp 127-136, issn 1089-778X, 10 p.Article

Differential approximation of NP-hard problems with equal size feasible solutionsMONNOT, Jérome.RAIRO. Recherche opérationnelle. 2002, Vol 36, Num 4, pp 279-297, issn 0399-0559, 19 p.Article

Randomized weighted caching with two page weightsIRANI, S.Algorithmica. 2002, Vol 32, Num 4, pp 624-640, issn 0178-4617Article

On-line edge-coloring with a fixed number of colorsFAVRHOLDT, Lene Monrad; NIELSEN, Morten Nyhave.Algorithmica. 2003, Vol 35, Num 2, pp 176-191, issn 0178-4617, 16 p.Article

BubbleSearch : A simple heuristic for improving priority-based greedy algorithmsLESH, N; MITZENMACHER, M.Information processing letters. 2006, Vol 97, Num 4, pp 161-169, issn 0020-0190, 9 p.Article

Worst-case complexity and empirical evaluation of artificial intelligence methods for unsupervised word sense disambiguationSCHWAB, Didier; GOULIAN, Jérôme; TCHECHMEDJIEV, Andon et al.International journal of Web engineering and technology. 2013, Vol 8, Num 2, pp 124-153, issn 1476-1289, 30 p.Article

Bounding the power of preemption in randomized schedulingCANETTI, R; IRANI, S.SIAM journal on computing (Print). 1998, Vol 27, Num 4, pp 993-1015, issn 0097-5397Article

Communication-Avoiding Krylov Techniques on Graphic Processing UnitsMEHRIDEHNAVI, Maryam; EL-KURDI, Yousef; DEMMEL, James et al.IEEE transactions on magnetics. 2013, Vol 49, Num 5, pp 1749-1752, issn 0018-9464, 4 p.Conference Paper

Space-efficient scheduling of multithreaded computationsBLUMOFE, R. D; LEISERSON, C. E.SIAM journal on computing (Print). 1998, Vol 27, Num 1, pp 202-229, issn 0097-5397Article

Randomized group testing for mutually obscuring defectivesDAMASCHKE, P.Information processing letters. 1998, Vol 67, Num 3, pp 131-135, issn 0020-0190Article

Graphics Processing Unit Accelerated O(N) Micromagnetic SolverSHAOJING LI; LIVSHITZ, Boris; LOMAKIN, Vitaliy et al.IEEE transactions on magnetics. 2010, Vol 46, Num 6, pp 2373-2375, issn 0018-9464, 3 p.Conference Paper

Analysis of the Computational Cost of Approximation-Based Hybrid Evolutionary Algorithms in Electromagnetic DesignGUIMARAES, Frederico G; LOWTHER, David A; RAMIREZ, Jaime A et al.IEEE transactions on magnetics. 2008, Vol 44, Num 6, pp 1130-1133, issn 0018-9464, 4 p.Conference Paper

Optimization of cost functions using evolutionary algorithms with local learning and local searchGUIMARAES, Frederico G; CAMPELO, Felipe; IGARASHI, Hajime et al.IEEE transactions on magnetics. 2007, Vol 43, Num 4, pp 1641-1644, issn 0018-9464, 4 p.Conference Paper

On-line maximizing the number of items packed in variable-sized binsEPSTEIN, Leah; FAVRHOLDT, Lene M.Lecture notes in computer science. 2002, pp 467-475, issn 0302-9743, isbn 3-540-43996-X, 9 p.Conference Paper

A survey of randomness and parallelism in comparison problemsKRIZANC, D.Lecture notes in computer science. 1998, pp 324-329, issn 0302-9743, isbn 3-540-64359-1Conference Paper

Randomized parallel prefetching and buffer managementVARMAN, P. J.Lecture notes in computer science. 1998, pp 363-372, issn 0302-9743, isbn 3-540-64359-1Conference Paper

Improved randomized on-line algorithms for the list update problemALBERS, S.SIAM journal on computing (Print). 1998, Vol 27, Num 3, pp 682-693, issn 0097-5397Article

Randomized online multi-threaded pagingSEIDEN, S. S.Lecture notes in computer science. 1998, pp 264-275, issn 0302-9743, isbn 3-540-64682-5Conference Paper

An optimal parallel algorithm for sorting multisetsRAJASEKARAN, S.Information processing letters. 1998, Vol 67, Num 3, pp 141-143, issn 0020-0190Article

Computing many maximal independent sets for hypergraphs in parallelKHACHIYAN, Leonid; BOROS, Endre; GURVICH, Vladimir et al.Parallel processing letters. 2007, Vol 17, Num 2, pp 141-152, issn 0129-6264, 12 p.Article

Cultured differential evolution for constrained optimizationBECERRA, Ricardo Landa; COELLO, Carlos A. Coello.Computer methods in applied mechanics and engineering. 2006, Vol 195, Num 33-36, pp 4303-4322, issn 0045-7825, 20 p.Article

Using nondeterminism to design efficient deterministic algorithmsJIANER CHEN; FRIESEN, Donald K; WEIJIA JIA et al.Algorithmica. 2004, Vol 40, Num 2, pp 83-97, issn 0178-4617, 15 p.Article

Online routing in convex subdivisionsBOSE, Prosenjit; BRODNIK, Andrej; CARLSSON, Svante et al.Lecture notes in computer science. 2000, pp 47-59, issn 0302-9743, isbn 3-540-41255-7Conference Paper

  • Page / 10048