Narrow search
Showing 63,051 - 63,060 of 63,677
Cover Image
A floating random-walk algorithm for extracting electrical capacitance
Iverson, Ralph B.; Le Coz, Yannick L. - In: Mathematics and Computers in Simulation (MATCOM) 55 (2001) 1, pp. 59-66
In 1991, we developed a floating random-walk algorithm to extract electrical capacitance in 2D structures. Since then … circuits (ICs) represented by multi-gigabyte databases. The algorithm has proven to be exceptionally powerful and is now … underlying the floating random-walk algorithm: a formulation of capacitance as an integral of infinite dimensionality evaluated …
Persistent link: https://www.econbiz.de/10011050954
Cover Image
A Krylov subspace approach to large portfolio optimization
Bajeux-Besnainou, Isabelle; Bandara, Wachindra; Bura, … - In: Journal of Economic Dynamics and Control 36 (2012) 11, pp. 1688-1699
portfolio. BFGMRES is a numerical algorithm that provides solutions to singular linear systems without requiring ex …
Persistent link: https://www.econbiz.de/10011051937
Cover Image
Scheduling with few changes
Mütze, Torsten - In: European Journal of Operational Research 236 (2014) 1, pp. 37-50
In this work we consider scheduling problems where a sequence of assignments from products to machines – or from tasks to operators, or from workers to resources – has to be determined, with the goal of minimizing the costs (=money, manpower, and/or time) that are incurred by the interplay...
Persistent link: https://www.econbiz.de/10011052621
Cover Image
Automating the analysis of variance of orthogonal designs
Großmann, Heiko - In: Computational Statistics & Data Analysis 70 (2014) C, pp. 1-18
A new algorithm is presented which for the wide class of orthogonal designs is capable of deducing the appropriate …
Persistent link: https://www.econbiz.de/10011056418
Cover Image
Research on tax revenue increasing faster than GDP increasing based upon industry structure
Dengshan, TANG; Hong, WU - In: Frontiers of Economics in China 4 (2009) 2, pp. 192-208
develop a theoretical model and responding algorithm about this phenomenon based on industry structure and their tax burden …
Persistent link: https://www.econbiz.de/10010944922
Cover Image
An Algorithm for Identifying Agent-k-linked Allocations in Economies with Indivisibilities
Andersson, Tommy; Ehlers, Lars - Nationalekonomiska Institutionen, Ekonomihögskolan - 2014
manipulable envy-free rule can be obtained via agent-k-linked allocations. Given this observation, we provide an algorithm for …
Persistent link: https://www.econbiz.de/10010945031
Cover Image
Analysis of a finite-source customer assignment model with no state information
Hordijk, Arie; Loeve, Anneke; Tiggelman, Jeroen - In: Mathematical Methods of Operations Research 47 (1998) 2, pp. 317-336
routing decision may not depend on the numbers of customers in the queues. We present an algorithm and we show that it … computes an average optimal policy in case of exponential service times. The algorithm also works for non-exponential service …
Persistent link: https://www.econbiz.de/10010950371
Cover Image
The pentagon of vulnerability and resilience: A methodological proposal in development economics by using graph theory
Bates, Samuel; Angeon, Valérie; Ainouche, Ahmed - Université Paris-Dauphine (Paris IX) - 2014
of the pentagon. We propose an algorithm to select the key variables useful in building a composite index that conforms …
Persistent link: https://www.econbiz.de/10010960555
Cover Image
Stable lexicographic rules for shortest path games
Bahel, Eric; Trudeau, Christian - In: Economics Letters 125 (2014) 2, pp. 266-269
For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate shares according to some lexicographic preference relation. A computational procedure is provided. Our results relate to those of Tijs et al. (2011).
Persistent link: https://www.econbiz.de/10011076563
Cover Image
An Algorithm for Identifying Agent-k-Linked Allocations in Economies with Indivisibilities
ANDERSSON, Tommy; EHLERS, Lars - Centre Interuniversitaire de Recherche en Économie … - 2013
least manipulable envy-free rule can be obtained via agent-k-linked allocations. This note provides an algorithm for …
Persistent link: https://www.econbiz.de/10010927904