نتایج جستجو برای: the best and worst optimal values

تعداد نتایج: 21192255  

2003
D. G. Bates T. Mannchen

We describe some new tools for the clearance of flight control laws for highly augmented aircraft. The tools are developed from general -analysis methods, and are applied to the clearance of a flight control law for a vertical/short take-off and landing aircraft. Stability robustness analysis results for the flight control law are presented in terms of the standard clearance criteria currently ...

1993
Bruno Becker Stephan Gschwind Thomas Ohler Bernhard Seeger Peter Widmayer

We propose an asymptotically optimal multiversion B-tree. In our setting, insertions and deletions of data items are allowed only for the present version, whereas range queries and exact match queries are allowed for any version, present or past. The technique we present for transforming a (usual single version) B-tree into a multiversion B-tree is more general: it applies to a number of spatia...

2015
Isabella Hoffmann Sascha Kurz Jörg Rambau

In the maximum scatter traveling salesman problem the objective is to find a tour that maximizes the shortest distance between any two consecutive nodes. This model can be applied to manufacturing processes, particularly laser melting processes. We extend an algorithm by Arkin et al. that yields optimal solutions for nodes on a line to a regular m×n-grid. The new algorithm Weave(m,n) takes line...

Journal: :Theor. Comput. Sci. 2010
Stephan Holzer Yvonne Anne Pignolet Jasmin Smula Roger Wattenhofer

Wireless networks often experience a significant amount of churn, i.e. the arrival and departure of nodes, and often it is necessary to keep all nodes informed about all other nodes in the network. In this paper we propose a distributed algorithm for single-hop networks that detects churn, meaning that the nodes observe other nodes joining or leaving the network and inform all other nodes in th...

2013
R. C. Hu W. Q. Zhu

A stochastic minimax optimal control strategy for uncertain quasi-Hamiltonian systems is proposed based on the stochastic averaging method, stochastic maximum principle and stochastic differential game theory. First, the partially completed averaged Itô stochastic differential equations are derived from a given system by using the stochastic averaging method for quasi-Hamiltonian systems with u...

Journal: :IEEE Trans. Contr. Sys. Techn. 2003
Zoltan K. Nagy Richard D. Braatz

A novel approach is proposed that quantifies the influence of parameter and control implementation uncertainties upon the states and outputs of finite-time control trajectories for nonlinear lumped and distributed parameter systems. The worst-case values of the states and outputs due to model parameter uncertainties are computed as a function of time along the control trajectories. The algorith...

Journal: :PVLDB 2012
Cheng Sheng Nan Zhang Yufei Tao Xin Jin

A hidden database refers to a dataset that an organization makes accessible on the web by allowing users to issue queries through a search interface. In other words, data acquisition from such a source is not by following static hyper-links. Instead, data are obtained by querying the interface, and reading the result page dynamically generated. This, with other facts such as the interface may a...

Journal: :Fuzzy Sets and Systems 2007
Masami Kurano Masami Yasuda Jun-ichi Nakagami Yuji Yoshida

This paper is a sequel to Kurano et al [9], [10], in which the fuzzy perceptive models for optimal stopping or discounted Markov decision process is given. We proposed a method of computing the corresponding fuzzy perceptive values. Here, we deal with the average case for Markov decision processes with fuzzy perceptive transition matrices and characterize the optimal average expected reward, ca...

Journal: :Math. Oper. Res. 1995
Nahum Shimkin Adam Shwartz

This paper addresses the problem of dynamic decision making in an uncertain and competitive environment. A decision maker (player 1) faces a system about which he has some (parametric) uncertainty, and which is affected also by the actions of other agents. We focus on a worst-case analysis from the viewpoint of player 1, using the simplified model of a repeated matrix game with lack of informat...

2008
DAVID J. ALDOUS DAVID ALDOUS

Consider networks on n vertices at average density 1 per unit area. We seek a network that minimizes total length subject to some constraint on journey times, averaged over sourcedestination pairs. Suppose journey times depend on both route-length and number of hops. Then for the constraint corresponding to an average of 3 hops, the length of the optimal network scales as n13/10. Alternatively,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید