Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Méthode diviser pour régner")

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 553

  • Page / 23

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

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 parallel multistage method for surface/surface intersectionBÜRGER, H; SCHABACK, R.Computer aided geometric design. 1993, Vol 10, Num 3-4, pp 277-291, issn 0167-8396Conference Paper

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

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

Fast algorithms through divide- and combine-and-conquer strategiesPEREZ-JORDA, J. M.Computer physics communications. 1999, Vol 117, Num 3, pp 239-240, issn 0010-4655Article

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

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

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

Maximum independent set for intervals by divide and conquer with pruningSNOEYINK, Jack.Networks (New York, NY). 2007, Vol 49, Num 2, pp 158-159, issn 0028-3045, 2 p.Article

Divide and conquer: Genetic programming based on multiple Branches encodingRODRIGUEZ-VAZQUEZ, Katya; OLIVER-MORALES, Carlos.Lecture notes in computer science. 2003, pp 218-228, issn 0302-9743, isbn 3-540-00971-X, 11 p.Conference Paper

Distributed proxy: A design pattern for the incremental development of distributed applicationsRITO SILVA, Antonio; ASSIS ROSA, Francisco; GONCALVES, Teresa et al.Lecture notes in computer science. 2001, pp 165-181, issn 0302-9743, isbn 3-540-41792-3Conference Paper

Ahnentafel indexing into morton-ordered arrays, or matrix locality for freeWISE, D. S.Lecture notes in computer science. 2000, pp 774-783, issn 0302-9743, isbn 3-540-67956-1Conference Paper

Learning logic programs with local variables from positive examplesKRISHNA RAO, M. R. K; SATTAR, A.Lecture notes in computer science. 1999, pp 469-471, issn 0302-9743, isbn 3-540-66822-5Conference Paper

Optimal k-ary Divide&Conquer computations on wormhole 2-D and 3-D meshesTRDLICKA, J; TVRDIK, P.Lecture notes in computer science. 1999, pp 253-260, issn 0302-9743, isbn 3-540-66907-8Conference Paper

  • Page / 23