Download or read book Contribution a l algorithmique non numerique parallele exploration d espaces de recherche written by Van-Dat Cung and published by . This book was released on 1994 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Handbook of Combinatorial Optimization written by Ding-Zhu Du and published by Springer Science & Business Media. This book was released on 2013-12-01 with total page 2410 pages. Available in PDF, EPUB and Kindle. Book excerpt: Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics).

Download or read book Handbook of combinatorial optimization written by Dingzhu Du and published by Springer Science & Business Media. This book was released on 1998-12-15 with total page 880 pages. Available in PDF, EPUB and Kindle. Book excerpt: Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dual heuristics)."

Download or read book CONTRIBUTION A L ALGORITHMIQUE NON NUMERIQUE PARALLELE written by Bernard Mans and published by . This book was released on 1992 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: LE BUT DE CETTE THESE EST D'ETUDIER LA PARALLELISATION DES METHODES DE RESOLUTION DES PROBLEMES D'OPTIMISATION COMBINATOIRE REPUTES NP-DIFFICILES: LES PROBLEMES DE RECHERCHE ARBORESCENTE PAR SEPARATION ET EVALUATION OU BRANCH AND BOUND. ELLE EST COMPOSEE DE TROIS PARTIES COMPLEMENTAIRES. DANS LA PREMIERE PARTIE, NOUS PRESENTONS LES DIFFERENTES DEFINITIONS ESSENTIELLES AU BRANCH AND BOUND. LE PARALLELISME INTRINSEQUE A CETTE METHODE EST DEGAGE ET UN MODELE D'EVALUATION DE PERFORMANCES DES BRANCH AND BOUND PARALLELES EST INTRODUIT, (CHAPITRE 1). LES DIFFERENTS PHENOMENES D'ANOMALIES D'ACCELERATION ET LA LIMITE DES SOLUTIONS CONNUES SONT PRESENTES DANS LE CHAPITRE 2. LE CHAPITRE 3 POSE LES PROBLEMES CLASSIQUES SOULEVES PAR L'IMPLEMENTATION PARALLELE. LA DEUXIEME PARTIE S'ATTACHE A PROPOSER DES SOLUTIONS A DES PROBLEMES PRIMORDIAUX: 1) LES ANOMALIES D'ACCELERATIONS, (CHAPITRE 5); DES BORNES SERREES AINSI QU'UNE PROPRIETE DE PREDISPOSITION AUX ANOMALIES SONT INTRODUITES ET PERMETTENT DES CHOIX PRECIS PARMI DIFFERENTES REGLES, 2) LA GRANULARITE DU TRAVAIL ALLOUE AUX PROCESSEURS, (CHAPITRE 6); LES GAINS ET SURCOUTS MIS EN EVIDENCE POUR UN PROCEDE DE SEPARATION POLYTOMIQUE PERMETTENT DE PROUVER SON INTERET, 3) L'ACCES AUX DONNEES PARTAGEES, (CHAPITRE 7); DES STRUCTURES DE DONNEES BIEN ADAPTEES AU BRANCH AND BOUND SONT ETUDIEES ET COMPAREES; POUR RESOUDRE LA CONTENTION D'ACCES A LA MEMOIRE, LES OPERATIONS DE BASES SUR CES STRUCTURES SONT RENDUES CONCURRENTES; LEURS PERFORMANCES SONT CONSERVEES ET LE SURCOUT D'IMPLEMENTATION REDUIT PAR UNE METHODE DE MARQUAGE, 4) L'EQUILIBRAGE DE CHARGE DES RESEAUX D'INTERCONNEXION DE PROCESSEURS, (CHAPITRE 8); UNE NOUVELLE FONCTION DE CHARGE ET UNE REGLE DE DECISION D'EQUILIBRAGE S'ADAPTANT D'ELLE-MEME A L'EVOLUTION DE LA RESOLUTION SONT DEVELOPPEES ET CONDUISENT A LA DESCRIPTION D'UN BRANCH AND BOUND DISTRIBUE. ENFIN, DANS LA TROISIEME PARTIE, NOUS TESTONS CES SOLUTIONS EN CONCEVANT DES BRANCH AND BOUND PARALLELES EFFICACES POUR DEUX PROBLEMES REPUTES DIFFICILES: 1) L'AFFECTATION QUADRATIQUE, CHAPITRE 9, OU LES PROBLEMES DE GRANULARITE ET D'ACCES AUX DONNEES SONT IMPORTANTS, 2) LE SAC-A-DOS MULTIDIMENSIONNEL, CHAPITRE 10, OU L'INTERET D'UNE SEPARATION POLYTOMIQUE POUR LA GRANULARITE SE CONFIRME

Download or read book CONTRIBUTION A L ALGORITHMIQUE PARALLELE DES STRUCTURES DE DONNEES ET DES STRUCTURES DISCRETES written by MICHEL.. GASTALDO and published by . This book was released on 1993 with total page 145 pages. Available in PDF, EPUB and Kindle. Book excerpt: CETTE THESE SE SITUE DANS LE CADRE DE L'ALGORITHMIQUE PARALLELE NON NUMERIQUE. DEUX GRANDS POINTS SONT PRINCIPALEMENT ABORDES, LES STRUCTURES DE DONNEES SUR ARCHITECTURES A MEMOIRE DISTRIBUEE, A TRAVERS LA MACHINE DICTIONNAIRE, ET L'ALGORITHMIQUE PARALLELES POUR LES GRAPHES, AVEC LA FERMETURE TRANSITIVE ET LA RECONNAISSANCE DES ORDRES D'INTERVALLES

Download or read book Proceedings written by and published by . This book was released on 1995 with total page 636 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Contribution l algorithmique non num rique dans les ensembles ordonn s written by Etienne Pichat and published by . This book was released on with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Contribution l algorithmique non num rique dans les ensembles ordonn s written by Étienne Pichat and published by . This book was released on 1970 with total page 268 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Parallel Computing 91 written by D. J. Evans and published by North Holland. This book was released on 1992 with total page 648 pages. Available in PDF, EPUB and Kindle. Book excerpt: The Parallel Computing '91 International Conference was a continuation of the series of conferences held in 1983, 1985 and 1989. The aim of this proceedings volume is to provide an overview of new and recent developments, applications and trends in parallel computing. The emphasis is on applications, with the invited lectures covering thriving topics including: artificial intelligence, neural networks, parallel computer performance, parallel numerical and non-numerical algorithms. Contributed papers address a wider variety of topics. Main Features: Surveys of recent work in parallel computing involving computer architectures, parallel software and algorithms, and applications. Recent work in parallel computing presented by active researchers. Information on parallel computing activities.

Download or read book Contribution a l algorithmique parallele des structures de donnees et des structures discretes machine dictionnaire et algorithmes pour les graphes written by Michel Gastaldo and published by . This book was released on 1993 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Advances in Parallel Computing written by and published by . This book was released on 1990 with total page 388 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Contributions l algorithmique parall le written by Claude Tadonki and published by . This book was released on 2001 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Parameter Setting in Evolutionary Algorithms written by F.J. Lobo and published by Springer Science & Business Media. This book was released on 2007-03-16 with total page 323 pages. Available in PDF, EPUB and Kindle. Book excerpt: One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, operator probabilities, not to mention the representation and the operators themselves. This book gives the reader a solid perspective on the different approaches that have been proposed to automate control of these parameters as well as understanding their interactions. The book covers a broad area of evolutionary computation, including genetic algorithms, evolution strategies, genetic programming, estimation of distribution algorithms, and also discusses the issues of specific parameters used in parallel implementations, multi-objective evolutionary algorithms, and practical consideration for real-world applications. It is a recommended read for researchers and practitioners of evolutionary computation and heuristic methods.

Download or read book Quelques probl mes num riques et non num riques en calcul parall le written by Moustafa Nakechbandi and published by . This book was released on 1979 with total page 73 pages. Available in PDF, EPUB and Kindle. Book excerpt: Etude de l'existence du parallélisme dans les problèmes de recherche opérationnelle et de cheminement, en essayant d'une part d'estimer le gain que peut apporter l'introduction du parallélisme pour des algorithmes séquentiels classiques et d'autre part de proposer de nouveaux algorithmes concus pour ce type d'exploitation

Download or read book Quelques R sultats de Complexit en Algorithmique Parall le Et Systolique written by Denis Trystram (chercheur en informatique).) and published by . This book was released on 1988 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: L'objet de cette thèse est l'étude de la parallélisation d'algorithmes du calcul scientifique et leur implémentation sur des ordinateurs parallèles à mémoire partagée et sur des réseaux systoliques. Un accent particulier est mis sur l'obtention de résultats de complexité. La thèse est organisée autour d'articles et textes de conférences qui sont analysés et discutés dans une première partie de façon à permettre de replacer les problèmes traités dans leur contexte. Dans le premier chapitre, nous présentons les principaux résultats théoriques concernant l'étude de complexité des algorithmes parallèles, ainsi qu'une description critique de l'architecture de référence, qui est une machine de type MIMD à mémoire partagée. Le chapitre suivant est dédie" à l'ensemble des résultats de complexité concernant les algorithmes de diagonalisation et l'élimination de Gauss, il a pour but d'illustrer la méthodologie. Il existe en tout dix écritures possibles de la méthode de Gauss, qui conduisent principalement à deux grandes classes de graphes de précédente, conceptuellement différents : les graphes de type "glouton" et ceux du type "2 pas". Ces types de graphes se rencontrent d'une manière plus générale dans d'autres problèmes d'algèbre linéaire et même dans certaines méthodes non numériques de la théorie des graphes. Nous développons les résultats de complexité concernant ces deux types de graphes sur les exemples les plus courant (versions kji et kij de Gauss en parallèle), puis nous montrons comment adapter l'étude en prenant en compte t'es temps de communication entre tes processeurs, ce qui rend le modèle théorique plus réaliste. Le chapitre 6 est consacré aux architectures systoliques. Le problème du chemin algébrique permet d'unifier plusieurs problèmes informatiques. Nous présentons un réseau résolvant ce problème en Sn-2 pas sur un réseau de taille n(n+l ). De plus, quelques modifications permettent de calculer des projections en filtrage adaptatif en vu d'obtenir une solution en temps réel pour le traitement numérique des signaux. Avant de conclure, nous présentons des résultats complémentaires de parallélisation effective sur d'autres types d'architectures : l'étude de l'algorithme du gradient conjugué sur des super calculateurs (CRAY-XMP et IBM 3090-VF).

Download or read book Proceedings of the 17th Annual International Symposium on High Performance Computing Systems and Applications and the OSCAR Symposium written by National Research Council Canada and published by NRC Research Press. This book was released on 2003 with total page 354 pages. Available in PDF, EPUB and Kindle. Book excerpt: The 17th annual International Symposium on High Performance Systems and Applications (HPCS 2003) and the first OSCAR Symposium were held in Sherbrooke, Quebec Canada, May 11-14, 2003. The proceedings cover various areas of High Performance Computing, from specific scientific applications to computer architecture. OSCAR is an Open Source clustering software suite for building, maintaining, and using high performance clusters.

Download or read book Government Reports Announcements Index written by and published by . This book was released on 1991 with total page 762 pages. Available in PDF, EPUB and Kindle. Book excerpt: