Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Método dividir para vencer")

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


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

Author Country

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

Results 1 to 25 of 657

  • Page / 27

Selection :

  • and

The zigzag path of a pseudo-triangulationAICHHOLZER, Oswin; ROTE, Günter; SPECKMANN, Bettina et al.Lecture notes in computer science. 2003, pp 377-388, issn 0302-9743, isbn 3-540-40545-3, 12 p.Conference Paper

Graph separator algorithms: A refined analysisFERNAU, Henning.Lecture notes in computer science. 2002, pp 186-197, issn 0302-9743, isbn 3-540-00331-2, 12 p.Conference Paper

Task allocation onto a hypercube by recursive mincut bipartitioningERCAL, F; RAMANUJAM, J; SADAYAPPAN, P et al.Journal of parallel and distributed computing (Print). 1990, Vol 10, Num 1, pp 35-44, issn 0743-7315, 10 p.Article

Building executable union slices using conditioned slicingDANICIC, Sebastian; DE LUCIA, Andrea; HARMAN, Mark et al.International Workshop on Program Comprehension. 2004, pp 89-97, isbn 0-7695-2149-5, 1Vol, 9 p.Conference Paper

A divide and conquer algorithm for computing singular valuesCHANDRASEKARAN, S; IPSEN, I. C. F.Zeitschrift für angewandte Mathematik und Mechanik. 1994, Vol 74, Num 6, pp T532-T534, issn 0044-2267Article

Solution of a divide-and-conquer maximin recurrenceZHIYUAN LI; REINGOLD, E. M.SIAM journal on computing (Print). 1989, Vol 18, Num 6, pp 1188-1200, issn 0097-5397Article

SVM classi£cation tree algorithm with application to face membership authenticationSHAONING PANG.International Joint Conference on Neural Networks. 2004, isbn 0-7803-8359-1, 4Vol, vol1, 431-436Conference Paper

A java framework for massively distributed symbolic computingBERNARDIN, L.Mathematics and computers in simulation. 1999, Vol 49, Num 3, pp 151-160, issn 0378-4754Article

Iterative versus simultaneous multiple sequence alignmentDRESS, A.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63220-4, p. 275Conference Paper

A note on the iterative algorithm for the Reve's puzzleMAJUMDAR, A. A. K.Computer journal (Print). 1994, Vol 37, Num 5, pp 463-464, issn 0010-4620Article

Calculating the self-intersections of Bézier curvesLASSER, D.Computers in industry. 1989, Vol 12, Num 3, pp 259-268, issn 0166-3615Article

MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple MoleculesHARIHARAN, Ramesh; JANAKIRAMAN, Anand; NILAKANTAN, Ramaswamy et al.Journal of chemical information and modeling. 2011, Vol 51, Num 4, pp 788-806, issn 1549-9596, 19 p.Article

A lambda-calculus with constructorsARBISER, Ariel; MIQUEL, Alexandre; RIOS, Alejandro et al.Lecture notes in computer science. 2006, pp 181-196, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 16 p.Conference Paper

Abstract modularityABBOTT, Michael; GHANI, Neil; LÜTH, Christoph et al.Lecture notes in computer science. 2005, pp 46-60, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

DeWall : A fast divide and conquer Delaunay triangulation algorithm in EdCIGNONI, P; MONTANI, C; SCOPIGNO, R et al.Computer-aided design. 1998, Vol 30, Num 5, pp 333-341, issn 0010-4485Article

SieveSort : Yet another sorting algorithmPAL, Rajat K.Analog and digital techniques in electrical engineering. Conference. 2004, isbn 0-7803-8560-8, Vol2, 357-360Conference Paper

A frame for general divide-and-conquer recurrencesWANG, X; FU, Q.Information processing letters. 1996, Vol 59, Num 1, pp 45-51, issn 0020-0190Article

A note on divide and conquer algorithms for the symmetric tridiagonal eigenvalue problemARBENZ, P; GATES, K.Zeitschrift für angewandte Mathematik und Mechanik. 1994, Vol 74, Num 6, pp T529-T531, issn 0044-2267Article

Minimizing global communication in parallel list rankingSIBEYN, Jop F.Lecture notes in computer science. 2003, pp 894-902, issn 0302-9743, isbn 3-540-40788-X, 9 p.Conference Paper

Divide-and-conquer algorithm for computing set containment joinsMELNIK, Sergey; GARCIA-MOLINA, Hector.Lecture notes in computer science. 2002, pp 427-444, issn 0302-9743, isbn 3-540-43324-4Conference Paper

Deriving algorithms on reconfigurable networks based on function decompositionGEN-HUEY CHEN; BIING-FENG WANG; HUNGWEN LI et al.Theoretical computer science. 1993, Vol 120, Num 2, pp 215-227, issn 0304-3975Article

Graph separation techniques for quadratic zero-one programmingPARDALOS, P. M; SOMESH JHA.Computers & mathematics with applications (1987). 1991, Vol 21, Num 6-7, pp 107-113, issn 0898-1221Article

Modeling and analysis of worm and killer-worm propagation using the divide-and-conquer strategyDAN WU; DONGYANG LONG; CHANGJI WANG et al.Lecture notes in computer science. 2005, pp 370-375, issn 0302-9743, isbn 3-540-29235-7, 1Vol, 6 p.Conference Paper

A lazy divide & conquer approach to constraint solvingANAND, Saswat; WEI-NGAN CHIN; SIAU-CHENG KHOO et al.Proceedings - International Conference on Tools with Artificial Intelligence, TAI. 2002, pp 91-98, issn 1082-3409, isbn 0-7695-1849-4, 8 p.Conference Paper

Balanced k-coloringsBIEDL, T. C; CENEK, E; CHAN, T. M et al.Lecture notes in computer science. 2000, pp 202-211, issn 0302-9743, isbn 3-540-67901-4Conference Paper

  • Page / 27