Narrow search
Showing 1 - 10 of 247
Cover Image
Comparing the efficiency of serial andparallel algorithms for training artificialneural networks using computer clusters
Kryuchin, Oleg V.; Arzamastev, Alexander A.; Troitzsch, … - Universität <Koblenz - 2011
An estimation of the number of multiplication and addition operations fortraining articial neural networks by means of consecutive and parallel algorithmson a computer cluster is carried out. The evaluation of the eciency of thesealgorithms is developed. The multilayer perceptron, the Volterra...
Persistent link: https://www.econbiz.de/10009353918
Cover Image
Produktivität und Effizienz in Banken –Terminologie, Methoden und Status quo
Burger, Andreas - Frankfurt School of Finance & Management, 10165439-X - 2008
This Working Paper gives insights into the concepts of productivity and efficiency. Both conceptsare popular measures … and outlines key areas of interest inthis context, such as efficiency measures, components of efficiency and the … measuring productivity and efficiency in a non-technical manner. Variousparametric as well as non parametric approaches are …
Persistent link: https://www.econbiz.de/10005865678
Cover Image
De Nederlandsche Bank - Monetary and financial statistics for the Netherlands
Nederlandsche Bank <Amsterdam>
This website of the Nederlandsche Bank (DNB) provides monetary and financial statistics for the Netherlands.
Persistent link: https://www.econbiz.de/10005852152
Cover Image
A hybrid ACO algorithm for the full truckload transportation problem
Hartl, Richard F.; Doerner, Karl; Reimann, Marc - 2001
In this paper we propose a hybrid ACO approach to solve a full truckload transportation problem. Hybridization is achieved through the use of a problem specific heuristic.(...)
Persistent link: https://www.econbiz.de/10005841609
Cover Image
A voting-merging clustering algorithm
Dimitriadou, Evgenia; Weingessel, Andreas; Hornik, Kurt - Institut für Informationsverarbeitung und -wirtschaft … - 1999
finding the number of clusters existing in them. The voting part of the algorithm allows us to combine several runs of …
Persistent link: https://www.econbiz.de/10005841714
Cover Image
Ein hybrider genetischer Algorithmus für das Containerbeladeproblem
Bortfeldt, Andreas; Gehring, Hermann - 1998
Der Beitrag präsentiert einen hybriden genetischen Algorithmus für das Containerbeladeproblem mit quaderförmigen … unter Einbeziehung von Verfahren anderer Autoren belegen eine gute Performance des genetischen Algorithmus vor allem für …The paper presents a hybrid genetic algorithm (GA) for the container loading problem with rectangularly shaped items of …
Persistent link: https://www.econbiz.de/10005844620
Cover Image
An efficient genetic algorithm for job shop scheduling with tardiness objectives
Mattfeld, Dirk C.; Bierwirth, Christian - 2002
We consider job shop scheduling problems with release and due-dates, as well as various tardiness objectives. To date, no efficient general-purpose heuristics have been developed for these problems. genetic algorithms can be applied almost directly, but come along with apparent weaknesses.
Persistent link: https://www.econbiz.de/10005847538
Cover Image
Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem
Bierwirth, Christian; Mattfeld, Dirk Christian; Watson, … - 2004
TWe perform a novel analysis of the fitness landscape of thejob-shop scheduling problem (JSP). In contrast to other well-known combinatorial optimization problems, we show that the landscape of the JSP is non-regular, in that the connectivity of solutions is variable.
Persistent link: https://www.econbiz.de/10005847540
Cover Image
Modeling the Use of Nonrenewable Resources Using a Genetic Algorithm
Schunk, Daniel - Sonderforschungsbereich Rationalitätskonzepte, … - 2003
This paper shows, how a genetic algorithm (GA) can be used to model an economic process: the interaction of profit …
Persistent link: https://www.econbiz.de/10005850470
Cover Image
Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
Kubach, Timo; Bortfeldt, Andreas; Gehring, Hermann - 2006
Given a finite set of circles of different sizes we study the Strip Packing Problem (SPP) as well as the Knapsack Problem (KP). The SPP asks for a placement of all circles (without overlap) within a rectangular strip of fixed width so that the variable length of the strip is minimized. The KP...
Persistent link: https://www.econbiz.de/10005856271