ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (85)
  • optimization  (85)
  • Springer  (85)
  • Periodicals Archive Online (PAO)
  • Computer Science  (63)
  • Economics  (25)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 52 (1991), S. 11-17 
    ISSN: 1436-4646
    Keywords: Modeling ; cancer ; optimization ; optimal control ; drug delivery
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we consider the problems of modeling the tumor growth and optimize the chemotherapy treatment. A biologically based model is used with the goal of solving an optimization problem involving discrete delivery of antineoplastic drugs. Our model is formulated via compartmental analysis in order to take into account the cell cycle. The cost functional measures not only the final size of the tumor but also the total amount of drug delivered. We propose an algorithm based on the discrete maximum principle to solve the optimal drug schedule problem. Our numerical results show nice interpretations from the medical point of view.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 15 (1994), S. 235-246 
    ISSN: 1436-6304
    Keywords: Simulation ; Optimierung ; Ernteprozeß ; Bedienungsprozeß ; räumliche Aspekte ; Einflußgröße ; Zielgröße ; Bewertungsprozeß ; Simulation ; optimization ; harvesting process ; operational process ; spacious aspects ; influence factor ; target value ; valuation process
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Abstract There is a wide range of possibilities for optimizing harvest process as transport-connected operations in a flow system. They are multi-stage operating process charakterized by a mixed arrangement of the operating elements. Above that, they have distinct spacious aspects. It is demonstrated which charakteristics of such processes have to be simulated by models, what target values should be determined in dependence on which influence factors and under which operational conditions. Furthermore it is elucidated how the valuation process for obtaining the desired information has to be shaped.
    Notes: Zusammenfassung Bei der Gestaltung von Ernteprozessen — beispielsweise des Prozesses „Mähdrusch, Körnertransport und -abnahme“ — als transportverbundene Fließarbeitsverfahren mit mindestens zwei verschiedenen Arbeitsmitteln gibt es einen großen Optimierungsspielraum. Solche Prozesse sind mehrstufige Bedienungsprozesse mit gemischter Anordnung der Bedienungseinrichtungen. Außerdem besitzen sie stark ausgeprägte räumliche Aspekte. Es wird vor allem gezeigt, welche Merkmale solcher Prozesse in Simulationsmodellen abgebildet sein müssen, welche Zielgrößen in Abhängigkeit von welchen Einflußgrößen unter Berücksichtigung welcher Prozeßbedingungen ermittelt werden sollten und wie der Bewertungsprozeß zur Ermittlung der gewünschten Informationen gestaltet werden muß.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    ISSN: 1436-6304
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; Latin hypercube ; optimization ; sampling ; sensitivity analysis ; Stichprobenverfahren ; Permutationsmatrizen ; implizite Funktionen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Lateinische Hyperwürfel Stichprobenverfahren (LHS) dienen dazu, in geeigneter Weise die Verteilungsfunktion (zumindest angenähert) der Funktionswerte einer komplexen (impliziten) Funktion, in Abhängigkeit ihrer Variablen werte, zu schätzen. Anwendungen finden sich in Modellen, in denen erforderliche Variablenumformungen nicht möglich sind und in denen die Zahl der Simulationsläufe aus zeitlichen Gründen gering zu halten oder fixiert ist. Es stellt sich die Frage, welche Werte in jedem Lauf den Variablen zuzuordnen sind. Herkömmliche Vorgehensweisen benutzen ausgefeilte, geschichtete Stichprobenverfahren, die jedoch Fehler bei der Bestimmung von Varianz und Kovarianz, aufgrund der Korrelation der Stichprobenpaare, beinhalten können. In dieser Arbeit wird eine Methode beschrieben, den absoluten Fehler zwischen dem tatsächlichen und dem korrelierenden Stichprobenpaar so klein wie möglich zu halten. Selbst für kleine Stichprobenumfänge können dabei schon optimale Pläne erzielt werden. Permutationsmatrizen haben die Eigenschaft, die Summe der Korrelationen zwischen Spaltenpaaren zu minimieren. Die vorgestellte Heuristik ist in der Lage, in allen getesteten Fällen das Optimum zu finden.
    Notes: Abstract The objective of Latin Hypercube Sampling is to determine an effective procedure for sampling from a (possibly correlated) multivariate population to estimate the distribution function (or at least a significant number of moments) of a complicated function of its variables. The typical application involves a computer-based model in which it is largely impossible to find a way (closed form or numerical) to do the necessary transformation of variables and where it is expensive to run in terms of computing resources and time. Classical approaches to hypercube sampling have used sophisticated stratified sampling techniques; but such sampling may provide incorrect measures of the output parameters' variances or covariances due to correlation between the sampling pairs. In this work, we offer a strategy which provides a sampling specification minimizing the sum of the absolute values of the pairwise differences between the true and sampled correlation pairs. We show that optimal plans can be obtained for even small sample sizes. We consider the characteristics of permutation matrices which minimize the sum of correlations between column pairs and then present an effective heuristic for solution. This heuristic generally finds plans which match the correlation structure exactly. When it does not, we provide a hybrid lagrangian/heuristic method, which empirically has found the optimal solution for all cases tested.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 61 (1993), S. 19-37 
    ISSN: 1436-4646
    Keywords: Self-scaling ; BFGS method ; quasi-Newton method ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We study the self-scaling BFGS method of Oren and Luenberger (1974) for solving unconstrained optimization problems. For general convex functions, we prove that the method is globally convergent with inexact line searches. We also show that the directions generated by the self-scaling BFGS method approach Newton's direction asymptotically. This would ensure superlinear convergence if, in addition, the search directions were well-scaled, but we show that this is not always the case. We find that the method has a major drawback: to achieve superlinear convergence it may be necessary to evaluate the function twice per iteration, even very near the solution. An example is constructed to show that the step-sizes required to achieve a superlinear rate converge to 2 and 0.5 alternately.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Design automation for embedded systems 3 (1998), S. 59-73 
    ISSN: 1572-8080
    Keywords: Code generation ; optimization ; digital signal processors
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We address the problem of code optimization for embedded DSP microprocessors. Such processors (e.g., those in the TMS320 series) have highly irregular datapaths, and conventional code generation methods typically result in inefficient code. In this paper we formulate and solve some optimization problems that arise in code generation for processors with irregular datapaths. In addition to instruction scheduling and register allocation, we also formulate the accumulator spilling and mode selection problems that arise in DSP microprocessors. We present optimal and heuristic algorithms that determine an instruction schedule simultaneously optimizing accumulator spilling and mode selection. Experimental results are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Formal methods in system design 3 (1993), S. 25-47 
    ISSN: 1572-8102
    Keywords: mechanical theorem proving ; primitive inference rules ; delayed computation ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The HOL system is afully expansive theorem prover: proofs generated in the system are composed of applications of the primitive inference rules of the underlying logic. One can have a high degree of confidence that such systems are sound, but they are far slower than theorem provers that exploit metatheoretic or derived properties. This paper presents techniques for postponing part of the computation so that the user of a fully expansive theorem prover can be more productive. The notions oflazy theorem andlazy conversion are introduced. These not only allow part of the computation to be delayed, but also permit nonlocal optimizations that are only possible because the primitive inferences are not performed immediately. The approach also opens the way to proof procedures that exploit metatheoretic properties without sacrificing security; the primitive inferences still have to be performed in order to generate a theorem, but during the proof development the user is free of the overheads they entail.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 5 (1985), S. 599-612 
    ISSN: 1572-9338
    Keywords: Microcomputers ; spreadsheets ; linear programming ; optimization ; software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper discusses the advantages of using spreadsheets for problem specification and report generation in optimization projects. It summarizes some of the mathematical programming software which is compatible with popular spreadsheets. A small production planning problem is used to illustrate the steps in input and processing of the results. Two programs are compared in detail.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 21 (1995), S. 337-389 
    ISSN: 1572-9443
    Keywords: Queueing networks ; loss networks ; multiarmed bandits ; bounds ; policies ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We survey a new approach that the author and his co-workers have developed to formulate stochastic control problems (predominantly queueing systems) asmathematical programming problems. The central idea is to characterize the region of achievable performance in a stochastic control problem, i.e., find linear or nonlinear constraints on the performance vectors that all policies satisfy. We present linear and nonlinear relaxations of the performance space for the following problems: Indexable systems (multiclass single station queues and multiarmed bandit problems), restless bandit problems, polling systems, multiclass queueing and loss networks. These relaxations lead to bounds on the performance of an optimal policy. Using information from the relaxations we construct heuristic nearly optimal policies. The theme in the paper is the thesis that better formulations lead to deeper understanding and better solution methods. Overall the proposed approach for stochastic control problems parallels efforts of the mathematical programming community in the last twenty years to develop sharper formulations (polyhedral combinatorics and more recently nonlinear relaxations) and leads to new insights ranging from a complete characterization and new algorithms for indexable systems to tight lower bounds and nearly optimal algorithms for restless bandit problems, polling systems, multiclass queueing and loss networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Queueing systems 12 (1992), S. 135-213 
    ISSN: 1572-9443
    Keywords: Queueing networks ; manufacturing systems ; design ; optimization ; second order properties ; convexity ; supermodularity ; transposition increasingness ; Schur convexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Design issues in various types of manufacturing systems such as flow lines, automatic transfer lines, job shops, flexible machining systems, flexible assembly systems and multiple cell systems are addressed in this paper. Approaches to resolving these design issues of these systems using queueing models are reviewed. In particular, we show how the structural properties that are recently derived for single and multiple stage queueing systems can be used effectively in the solution of certain design optimization problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 1572-9443
    Keywords: Effective service time ; age dependent service interruptions ; database systems ; failures ; recovery ; rollback ; checkpoints ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A stochastic model is developed describing a service system subject to inhomogeneous Poisson interruptions with age dependent interruption periods. By studying the probabilistic flow of the underlying multivariate Markov process, the Laplace transform of the effective service time is explicitly obtained. For general renewal interruptions, only the expected effective service time is derived. As an application, an optimal checkpoint policy is examined for database management. It is shown that an optimal policy maximizing the ergodic availability of the database is to implement a checkpoint as soon as the cumulative uptime of the database reaches a prespecified constantk *. A computational procedure is then developed for findingk * and numerical results are exhibited.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...