Relevant bibliographies by topics / Algorithmic mechanism / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Algorithmic mechanism.

Dissertations / Theses on the topic 'Algorithmic mechanism'

Author: Grafiati
Published: 7 June 2025
Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Algorithmic mechanism.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Cai, Yang Ph D. Massachusetts Institute of Technology. "Mechanism design : a new algorithmic framework." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82344.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 168-175).<br>A modern engineering system, e.g. the Internet, faces challenges from both the strategic behavior of its self-interested participants and the inherent computational intractability of large systems. Responding to this challenge, a new field, Algorithmic Mechanism Design, has emerged. One of the most fundamental problems in this field is How to optimize revenue in an auction? In his sem
APA, Harvard, Vancouver, ISO, and other styles
2

Guo, Minzhe. "Algorithmic Mechanism Design for Data Replication Problems." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470757536.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Thielen, Clemens [Verfasser]. "Approximation and Complexity in Algorithmic Mechanism Design / Clemens Thielen." München : Verlag Dr. Hut, 2010. http://d-nb.info/1002608104/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fadaei, Salman [Verfasser], Martin [Akademischer Betreuer] [Gutachter] Bichler, and Susanne [Gutachter] Albers. "Algorithmic Mechanism Design via Relaxation and Rounding / Salman Fadaei ; Gutachter: Martin Bichler, Susanne Albers ; Betreuer: Martin Bichler." München : Universitätsbibliothek der TU München, 2016. http://d-nb.info/1118722361/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Karande, Chinmay. "Algorithms and mechanism design for multi-agent systems." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/37229.

Full text
Abstract:
A scenario where multiple entities interact with a common environment to achieve individual and common goals either co-operatively or competitively can be classified as a Multi-Agent System. In this thesis, we concentrate on the situations where the agents exhibit selfish, competitive and strategic behaviour, giving rise to interesting game theoretic and optimization problems. From a computational point of view, the presence of multiple agents introduces strategic and temporal issues, apart from enhancing the difficulty of optimization. We study the following natural mathematical models of s
APA, Harvard, Vancouver, ISO, and other styles
6

Haddouni, Mounia. "Algorithmes de résolution de la dynamique du contact avec impact et frottement." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAI022/document.

Full text
Abstract:
La simulation des systèmes multicorps avec une dynamique non régulière trouve ses applications dans différents domaines comme l'aéronautique, l'automobile, le ferroviaire, la robotique, la réalité virtuelle et même l'industrie horlogère. Ces industries ont de plus en plus d'exigences sur la rapidité ainsi que la précision des méthodes utilisées pour calculer la dynamique. Par conséquent, la recherche dans le domaine de la mécanique non régulière est très active et a pour objectif constant de proposer des algorithmes plus robustes et plus rapides pour calculer la dynamique ainsi que de développ
APA, Harvard, Vancouver, ISO, and other styles
7

Williams, Cristyn Barry. "Colour constancy : human mechanisms and machine algorithms." Thesis, City University London, 1995. http://openaccess.city.ac.uk/7731/.

Full text
Abstract:
This thesis describes a quantitative experimental investigation into instantaneous colour constancy in humans. Colour constancy may be defined as the ability of the visual system to maintain a constant colour percept of a surface despite varying conditions of illumination. Instantaneous, in this context, refers to effects which happen very rapidly with the change of illumination, rather than those which may be due to long term adaptation of the photoreceptors. The results of experiments are discussed in the context of current computational models of colour constancy. Experiments on subjects wi
APA, Harvard, Vancouver, ISO, and other styles
8

Cortés, Juan. "Motion planning algorithms for general closed-chain mechanisms." Phd thesis, Institut National Polytechnique de Toulouse - INPT, 2003. http://tel.archives-ouvertes.fr/tel-00011002.

Full text
Abstract:
Un système robotique agit par le mouvement dans un monde physique. La capacité deplanification de mouvement est donc une composante essentielle de l'autonomie du système et constitue un domaine de recherche très actif en Robotique. Le champ d'application de ces méthodes dépasse aujourd'hui le cadre de la Robotique et intéresse des domaines aussi diversifiés que la CAO, la logistique industrielle, l'animation graphique ou la biologie moléculaire. Dans tous ces domaines on est confronté au mouvement de systèmes complexes contenant des chaînes cinématiques fermées. Cette thèse traite de la planif
APA, Harvard, Vancouver, ISO, and other styles
9

Connor, Andrew Miles. "The synthesis of hybrid mechanisms using genetic algorithms." Thesis, Liverpool John Moores University, 1996. http://researchonline.ljmu.ac.uk/5570/.

Full text
Abstract:
This thesis presents a novel design methodology for the synthesis of hybrid mechanisms using Genetic Algorithms. GAs are a search and optimisation method which model the mechanics of population genetics to give a truly global search method. In parallel to the development of a suitable GA, the work also develops novel objective function criteria which go some way to providing an approximation to dynamic criteria whilst using only kinematic properties during calculations. This has considerable effect in reducing the time required to find a feasible solution. The thesis presents a set of results
APA, Harvard, Vancouver, ISO, and other styles
10

Zainiev, Timur. "Quantum mechanics and the greedy algorithm." Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614850.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Wren, Kangda. "The modification of internal representations as a mechanism for learning in neural systems." Thesis, University College London (University of London), 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.272127.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Christensen, Peter W. "Computational nonsmooth mechanics : contact, friction and plasticity /." Linköping : Department of mechanical engineering, 2000. http://catalogue.bnf.fr/ark:/12148/cb40921031z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Gwilliam, Catherine Sarah. "Parallel algorithms for Navier-Stokes modelling." Thesis, University of Oxford, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.357478.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Giannakopoulos, Ioannis. "Duality theory for optimal mechanism design." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:90e1fdec-8803-4306-8985-5106c457f34d.

Full text
Abstract:
In this work we present a general duality-theory framework for revenue maximization in additive Bayesian auctions involving multiple items and many bidders whose values for the goods follow arbitrary continuous joint distributions over some multi-dimensional real interval. Although the single-item case has been resolved in a very elegant way by the seminal work of Myerson [1981], optimal solutions involving more items still remain elusive. The framework extends linear programming duality and complementarity to constraints with partial derivatives. The dual system reveals the natural geometric
APA, Harvard, Vancouver, ISO, and other styles
15

Collins, Mark. "An algorithm for evolving protocol constraints." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/1261.

Full text
Abstract:
We present an investigation into the design of an evolutionary mechanism for multiagent protocol constraint optimisation. Starting with a review of common population based mechanisms we discuss the properties of the mechanisms used by these search methods. We derive a novel algorithm for optimisation of vectors of real numbers and empirically validate the efficacy of the design by comparing against well known results from the literature. We discuss the application of an optimiser to a novel problem and remark upon the relevance of the no free lunch theorem. We show the relative performance of
APA, Harvard, Vancouver, ISO, and other styles
16

Zhao, Dengji. "Mechanism design for dynamic double auctions." Thesis, Toulouse 1, 2012. http://www.theses.fr/2012TOU10081/document.

Full text
Abstract:
Cette thèse a pour objet de concevoir des mécanismes d'allocation dans le contexte des enchères doubles dynamiques (achats groupés, bourses électroniques). Le principal défi inhérent à la conception de tels mécanismes est d'aboutir à un résultat socialement optimal alors que la dynamique induit une incertitude sur les arrivées et départs des participants de l'enchère ainsi que sur les valuations qui peuvent être fluctuantes. Dans cette thèse, nous proposons des mécanismes qui sont efficaces, incitatifs et garantissant l'équilibre du budget. La définition de ces mécanismes s'appuient sur les al
APA, Harvard, Vancouver, ISO, and other styles
17

Covantes, Osuna Edgar. "Theoretical and empirical evaluation of diversity-preserving mechanisms in evolutionary algorithms : on the rigorous runtime analysis of diversity-preserving mechanisms in evolutionary algorithms." Thesis, University of Sheffield, 2018. http://etheses.whiterose.ac.uk/23098/.

Full text
Abstract:
Evolutionary algorithms (EAs) simulate the natural evolution of species by iteratively applying evolutionary operators such as mutation, recombination, and selection to a set of solutions for a given problem. One of the major advantages of these algorithms is that they can be easily implemented when the optimisation problem is not well understood, and the design of problem-specific algorithms cannot be performed due to lack of time, knowledge, or expertise to design problem-specific algorithms. Also, EAs can be used as a first step to get insights when the problem is just a black box to the de
APA, Harvard, Vancouver, ISO, and other styles
18

Arteaga-Gomez, Joaquin M. "Development of crack generation and propagation algorithms for computational structural mechanics." Fairfax, VA : George Mason University, 2009. http://hdl.handle.net/1920/3430.

Full text
Abstract:
Thesis (M.S.)--George Mason University, 2009.<br>Vita: p. 64. Thesis director: Rainald Löhner. Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computational Sciences. Title from PDF t.p. (viewed June 10, 2009). Includes bibliographical references (p. 60-63). Also issued in print.
APA, Harvard, Vancouver, ISO, and other styles
19

Lu, Xin. "An efficient parallel optimization algorithm for the token bucket control mechanism." Thesis, University of Ottawa (Canada), 2004. http://hdl.handle.net/10393/26704.

Full text
Abstract:
The Token Bucket algorithm, one of the most widely used control mechanism nowadays, has been widely studied to ensure the QoS needs of various applications. However, one main drawback of current models of this algorithm is that most of them have focused on a single Token Bucket system. In this thesis, based on previous research efforts, we propose a parallel solution to the multiple Token Bucket model. We also develop a Reduced Memory Algorithm to decrease the algorithm's memory requirements at the cost of extra computation time. We test our parallel processing algorithm using two sets of trac
APA, Harvard, Vancouver, ISO, and other styles
20

McElwaine, James Nicholas. "Approximate consistency and prediction algorithms in quantum mechanics." Thesis, University of Cambridge, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Graf, Daryl H. (Daryl Herbert) Carleton University Dissertation Computer Science. "A neural controller for collision-free movement of robot manipulators." Ottawa, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
22

Kalainathan, Diviyan. "Generative Neural Networks to infer Causal Mechanisms : algorithms and applications." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS516.

Full text
Abstract:
La découverte de relations causales est primordiale pour la planification, le raisonnement et la décision basée sur des données d'observations ; confondre corrélation et causalité ici peut mener à des conséquences indésirables. La référence pour la découverte de relations causales est d'effectuer des expériences contrôlées. Mais dans la majorité des cas, ces expériences sont coûteuses, immorales ou même impossible à réaliser. Dans ces cas, il est nécessaire d'effectuer la découverte causale seulement sur des données d'observations. Dans ce contexte de causalité observationnelle, retrouver des
APA, Harvard, Vancouver, ISO, and other styles
23

Corus, Dogan. "Runtime analysis of evolutionary algorithms with complex fitness evaluation mechanisms." Thesis, University of Nottingham, 2018. http://eprints.nottingham.ac.uk/48421/.

Full text
Abstract:
Evolutionary algorithms (EAs) are bio-inspired general purpose optimisation methods which are applicable to a wide range of problems. The performance of an EA can vary considerably according to the problem it tackles. Runtime analyses of EAs rigorously prove bounds on the expected computational resources required by the EA to solve a given problem. A crucial component of an EA is the way it evaluates the quality (i.e. fitness) of candidate solutions. Different fitness evaluation methods may drastically change the efficiency of a given EA. In this thesis, the effects of different fitness evalua
APA, Harvard, Vancouver, ISO, and other styles
24

Wang, Lei. "Some approximation algorithms for multi-agent systems." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42726.

Full text
Abstract:
This thesis makes a number of contributions to the theory of approximation algorithm design for multi-agent systems. In particular, we focus on two research directions. The first direction is to generalize the classical framework of combinatorial optimization to the submodular setting, where we assume that each agent has a submodular cost function. We show hardness results from both the information-theoretic and computational aspects for several fundamental optimization problems in the submodular setting, and provide matching approximation algorithms for most of them. The second direction is t
APA, Harvard, Vancouver, ISO, and other styles
25

Floriani, Lauro. "Multivariate statistical methods for studying the mechanics of heuristics." Nice, 2002. http://www.theses.fr/2002NICE5705.

Full text
Abstract:
Les algorithmes constituent la plus efficace base de connaissances conçue par l'homme jusqu'à présent. La NP-completude indique que parmi l'ensemble des problèmes décidables il y en a que nous ne savons pas traiter de manière efficace, c. -à-d. Nous ne savons pas concevoir des algorithmes efficaces pour eux. Cependant, la pratique montre que beaucoup d'algorithmes sont quand même efficaces pour résoudre ces problèmes. C'est à dire que l'analyse expérimentale de leur relation entrée/sortie révèle une bien meilleure situation que ce qui peut être déduit d'une analyse mathématique des propriétés
APA, Harvard, Vancouver, ISO, and other styles
26

Hay, Alexander Morrison. "Optimal dimensional synthesis of planar parallel manipulators with respect to workspaces." Thesis, Pretoria : [s.n.], 2004. http://upetd.up.ac.za/thesis/available/etd-05042005-162107/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Han, Kyung Min. "Collision free path planning algorithms for robot navigation problem." Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/5021.

Full text
Abstract:
Thesis (M.S.)--University of Missouri-Columbia, 2007.<br>The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on September 29, 2008) Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
28

Patwardhan, Kaustubh Anil. "A feature-based algorithm for spike sorting involving intelligent feature-weighting mechanism." Thesis, University of Iowa, 2011. https://ir.uiowa.edu/etd/1253.

Full text
Abstract:
Spike sorting of neural data from multiple electrodes is a difficult problem that depends heavily on inputs from human experts. It is an important processing step in the study of various brain functions and to detect various neural disorders based on the activity of neurons. Here, we propose a novel, unsupervised, feature-based spike sorting method based on the K-means clustering algorithm to distinguish these spikes. It involves weighing the various features of the neural data based on their information content as well as the eigenvalues of their projections on the lower-dimensional space and
APA, Harvard, Vancouver, ISO, and other styles
29

Goebels, Andreas. "Agent coordination mechanisms for solving a partitioning task." Berlin Logos-Verl, 2006. http://deposit.d-nb.de/cgi-bin/dokserv?id=2907730&prov=M&dok_var=1&dok_ext=htm.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Ipek, Levent. "Optimization Of Backhoe-loader Mechanisms." Master's thesis, METU, 2006. http://etd.lib.metu.edu.tr/upload/12607722/index.pdf.

Full text
Abstract:
This study aims to develop a computer program to optimize the performance of loader mechanisms in backhoe-loaders. The complexity and the constraints imposed on the loader mechanism does not permit the use of classical optimization techniques used in the synthesis of mechanisms. Genetic algorithm is used to determine the values of the design parameters of the mechanism while satisfying the constraints and trying to maximize breakout forces that the machine can generate.
APA, Harvard, Vancouver, ISO, and other styles
31

Rattray, Magnus. "Modelling the dynamics of genetic algorithms using statistical mechanics." Thesis, University of Manchester, 1996. http://publications.aston.ac.uk/598/.

Full text
Abstract:
A formalism for modelling the dynamics of Genetic Algorithms (GAs) using methods from statistical mechanics, originally due to Prugel-Bennett and Shapiro, is reviewed, generalized and improved upon. This formalism can be used to predict the averaged trajectory of macroscopic statistics describing the GA's population. These macroscopics are chosen to average well between runs, so that fluctuations from mean behaviour can often be neglected. Where necessary, non-trivial terms are determined by assuming maximum entropy with constraints on known macroscopics. Problems of realistic size are describ
APA, Harvard, Vancouver, ISO, and other styles
32

Amir-Azizi, Siamak. "Linear filtering algorithms for Monte Carlo simulations." Thesis, University of Southampton, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280859.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Tonoyan, Arsen V. "Finite element mesh optimization using genetic algorithms." Diss., The University of Arizona, 2004. http://hdl.handle.net/10150/280756.

Full text
Abstract:
In finite element analysis, structures are modeled as meshes of elements and nodes appropriate for the geometry, boundaries and loading of each structure. Typically, it is desirable to have a mesh which is finer in parts of the structure where stress gradients are high and coarser where such gradients are low. This is usually done by experienced engineers using intuition and previous experience. Otherwise, a fine mesh throughout the structure can be used which results in high computational costs. In this work, the possibility of using genetic algorithms for optimizing finite-element meshes is
APA, Harvard, Vancouver, ISO, and other styles
34

Hung, Patrick Shepherd J. E. "Algorithms for reaction mechanism reduction and numerical simulation of detonations initiated by projectiles /." Diss., Pasadena, Calif. : California Institute of Technology, 2003. http://resolver.caltech.edu/CaltechETD:etd-05302003-142744.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Jaouen, Nicolas. "An automated approach to derive and optimise reduced chemical mechanisms for turbulent combustion." Thesis, Normandie, 2017. http://www.theses.fr/2017NORMIR03/document.

Full text
Abstract:
La complexité de la chimie joue un rôle majeur dans la simulation numérique de la plupart des écoulements réactifs industriels. L'utilisation de schémas cinétiques chimiques détaillés avec les outils de simulation actuels reste toutefois trop coûteuse du fait des faibles pas de temps et d'espaces associés à la résolution d'une flamme, bien souvent inférieurs de plusieurs ordres de grandeur à ceux nécessaires pour capturer les effets de la turbulence. Une solution est proposée pour s'affranchir de cette limite. Un outil automatisé de réduction de schémas cinétiques est développé sur la base d'u
APA, Harvard, Vancouver, ISO, and other styles
36

Alwagait, Esam Abdullah K. "A Broker based Web Service Allocation Mechanism." Doctoral thesis, Universitat Politècnica de València, 2011. http://hdl.handle.net/10251/12500.

Full text
Abstract:
Los servicios web son considerados por la industria y la investigación de facto por proporcionar funcionalidad de forma distribuida que sea usable en entornos heterogéneos. En pocas palabras, los servicios web son funcionalidad empaquetada que se basa en un conjunto de estándares que facilitan la definición de los métodos de los servicios web, sus números y formatos de entrada, así como sus números y formatos de salida. En combinación con la replicación, los servicios web pueden proporcionar soluciones de optimización del rendimiento a un número ilimitado de aplicaciones de negocio de la vida
APA, Harvard, Vancouver, ISO, and other styles
37

Hamad, F. M. "Energy-aware encryption mechanism for m-commerce devices." Thesis, Coventry University, 2010. http://curve.coventry.ac.uk/open/items/61037dc3-74e7-8cea-8e44-75f643220d0d/1.

Full text
Abstract:
With the wide spread of mobile phones, PDAs, and Smartphones, M-Commerce has become a major application domain for mobile devices, unlike conventional wired networks, mobile devices allow the user to conduct online transactions regardless of the time and the place as long as there is mobile network coverage. However, online transactions require adequate level of security to insure the confidentiality, the integrity, and the availability of the user’s information. Security measures consume a considerable amount of energy and require more time in processing. The aim of this thesis is to optimise
APA, Harvard, Vancouver, ISO, and other styles
38

Valsecchi, Sergio <1974&gt. "Parameters and algorithms to evaluate cardiac mechanics by conductance catheter." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/400/1/Tesi_Valsecchi.pdf.

Full text
Abstract:
This work is structured as follows: In Section 1 we discuss the clinical problem of heart failure. In particular, we present the phenomenon known as ventricular mechanical dyssynchrony: its impact on cardiac function, the therapy for its treatment and the methods for its quantification. Specifically, we describe the conductance catheter and its use for the measurement of dyssynchrony. At the end of the Section 1, we propose a new set of indexes to quantify the dyssynchrony that are studied and validated thereafter. In Section 2 we describe the studies carried out in this work: we repor
APA, Harvard, Vancouver, ISO, and other styles
39

Valsecchi, Sergio <1974&gt. "Parameters and algorithms to evaluate cardiac mechanics by conductance catheter." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2007. http://amsdottorato.unibo.it/400/.

Full text
Abstract:
This work is structured as follows: In Section 1 we discuss the clinical problem of heart failure. In particular, we present the phenomenon known as ventricular mechanical dyssynchrony: its impact on cardiac function, the therapy for its treatment and the methods for its quantification. Specifically, we describe the conductance catheter and its use for the measurement of dyssynchrony. At the end of the Section 1, we propose a new set of indexes to quantify the dyssynchrony that are studied and validated thereafter. In Section 2 we describe the studies carried out in this work: we repor
APA, Harvard, Vancouver, ISO, and other styles
40

Kesavan, Ram. "Communication mechanisms and algorithms for supporting scalable collective communication on parallel systems /." The Ohio State University, 1998. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487953204282155.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Sotolongo, Wilfredo. "On the numerical implementation of cyclic elasto-plastic material models." Thesis, Georgia Institute of Technology, 1985. http://hdl.handle.net/1853/17594.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Hilton, Adrian D. M. "Algorithms for estimating turbulent flow parameters from reciprocating engine laser doppler anemometer data." Thesis, University of Sussex, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.317005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Lucier, Brendan. "The Power of Uncertainty: Algorithmic Mechanism Design in Settings of Incomplete Information." Thesis, 2011. http://hdl.handle.net/1807/31843.

Full text
Abstract:
The field of algorithmic mechanism design is concerned with the design of computationally efficient algorithms for use when inputs are provided by rational agents, who may misreport their private values in order to strategically manipulate the algorithm for their own benefit. We revisit classic problems in this field by considering settings of incomplete information, where the players' private values are drawn from publicly-known distributions. Such Bayesian models of partial information are common in economics, but have been largely unexplored by the computer science community. In the first
APA, Harvard, Vancouver, ISO, and other styles
44

Kurach, Karol. "Deep Neural Architectures for Algorithms and Sequential Data." Doctoral thesis, 2016. https://depotuw.ceon.pl/handle/item/1860.

Full text
Abstract:
The first part of the dissertation describes two deep neural architectures with external memories: Neural Random-Access Machine (NRAM) and Hierarchical Attentive Memory (HAM). The NRAM architecture is inspired by Neural Turing Machines, but the crucial difference is that it can manipulate and dereference pointers to its random-access memory. This allows it to learn concepts that require pointers chasing, such as “linked list” or “binary tree”. The HAM architecture is based on a binary tree with leaves corresponding to memory cells. This enables the memory access in Θ(log n), which is a signifi
APA, Harvard, Vancouver, ISO, and other styles
45

Bolton, Hermanus Petrus Johannes. "Parallel competing algorithms in global optimization." Diss., 2001. http://hdl.handle.net/2263/22980.

Full text
Abstract:
Specialized techniques are needed to solve global optimization problems, due to the existence of multiple local optima or numerical noise in the objective function. The complexity of the problem is aggravated when discontinuities and constraints are present, or when evaluation of the objective function is computationally expensive. The global (minimization) programming problem is defined as finding the variable set for which the objective function obtains not only a local minimum, but also the smallest value, the global minimum. From a mathematical point of view, the global programming problem
APA, Harvard, Vancouver, ISO, and other styles
46

Kao, Yu-Zhong, and 高毓鍾. "The Cooperation Mechanism based on Particle Swarm Optimization Algorithm and Genetic Algorithm." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/30223174927244070713.

Full text
Abstract:
碩士<br>國立高雄海洋科技大學<br>輪機工程研究所<br>100<br>In this paper, a cooperation mechanism based on particle swarm optimization algorithm and genetic algorithm is investigated. The proposed algorithm reduces the possibility for minimum phenomenon of the traditional intelligent algorithm and increases the computing efficiency. Particle swarm optimization and the continuous real number genetic algorithm are provides the advantages to each other under the proposed cooperation mechanism. There are three benchmark problems that used to verify the effect of the proposed cooperation mechanism with numerical simula
APA, Harvard, Vancouver, ISO, and other styles
47

Lai, Po-wu, and 賴伯武. "Multi-Objective Evolutionary Algorithms with Constraints Handling Mechanism." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/10092241845851670716.

Full text
Abstract:
碩士<br>世新大學<br>資訊管理學研究所(含碩專班)<br>95<br>Multi-Objective Optimization (MOO) have been recently used in different kinds of fields. In methods of solving optimal solutions, there are different from classical method and Evolutionary Algorithms (EAs). EAs mimics nature’s evolutionary principles to drive its search towards an optimal solution. The mostly past research of MOO problems often focus on a algorithm of non-constrained problems. However, there are so many constrained MOO problems in the real world, and the constrains mechanism usually adopt a penalty function. But the design of penalty funct
APA, Harvard, Vancouver, ISO, and other styles
48

"A model-based selection mechanism in genetic algorithm." 2008. http://library.cuhk.edu.hk/record=b5893771.

Full text
Abstract:
Sit, Loi Yuk.<br>Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.<br>Includes bibliographical references (leaves 64-65).<br>Abstracts in English and Chinese.<br>Abstract --- p.i<br>Acknowledgement --- p.iii<br>Chapter 1 --- Introduction --- p.1<br>Chapter 2 --- Introduction to Genetic Algorithm --- p.5<br>Chapter 2.1 --- The Basic Genetic Algorithm --- p.5<br>Chapter 2.1.1 --- Selection Mechanisms --- p.7<br>Chapter 2.1.2 --- Variation Operators --- p.8<br>Chapter 2.2 --- Implementation of Genetic Algorithm --- p.10<br>Chapter 2.3 --- Examples of Combinatorial Optimization ---
APA, Harvard, Vancouver, ISO, and other styles
49

Chen, Chien-Lung, and 陳建龍. "Adaptive Linked-List Routing Algorithm with Wormhole Mechanism." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/qmggwc.

Full text
Abstract:
碩士<br>國立中山大學<br>電機工程學系研究所<br>104<br>Due to Low-Rate Wireless Personal Area Networks(LR-WPANs) is universally used in Internet of Things(IOT) in recent years, Chiu and Wang proposed a linked list routing algorithm with wormhole mechanism. The algorithm includes the manner of construction linked list network, data jumping for routing broken, a new node join mechanism, the manner of construction wormhole network and aim at the modbus protocol as application layer, set up suitable Modbus extension instructions for data collection. It’s an algorithm for IOT data collection. However, there are still
APA, Harvard, Vancouver, ISO, and other styles
50

Huang, Shih-Hua, and 黃仕華. "An Electromagnetism-like Mechanism Algorithm for Path Planning." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/28085453922385762005.

Full text
Abstract:
碩士<br>國立臺灣師範大學<br>電機工程學系<br>104<br>In this thesis, we propose a new path planning method by using an electromagnetism-like mechanism algorithm. We use different encoding methods to solve a trade-off problem which the traditional path planning method always deal with. In order to make vehicles move around in the safe way, a path smoothing method is integrated with the electromagnetism-like mechanism algorithm. Moreover, we compare two path smoothing methods, including Bezier Curve and Cubic Splines Interpolation, to find the better method which makes the vehicle turn smoothly and move around i
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Algorithmic mechanism' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography