检索结果-内蒙古大学图书馆

4TH IFAC Symposium on Adaptive Systems in Control and Signal Processing 1992

作者： JUDITSKY, A NAZIN, A INRIA IRISAF-35042 RENNESFRANCE

An adaptive tracking problem is considered for a linear stochastic SISO control plant. Several information bounds are obtained under a variety of conditions imposed on the disturbances and control strategies.

ISBN: (纸本)0080417175

关键词： ADAPTIVE CONTROL optimal algorithms LOWER BOUNDS EFFICIENT CONTROL STRATEGIES

来源：评论

学校读者我要写书评

暂无评论

RoomTetris in room committing: why the role of minimum-length-of-stay requirements should be revisited

引用

INTERNATIONAL JOURNAL OF CONTEMPORARY HOSPITALITY MANAGEMENT 2021年第11期33卷 4017-4034页

作者： Battiti, Roberto Brunato, Mauro Battiti, Filippo Univ Trento Dept Informat Engn & Comp Sci Trento Italy Ciaomanager SrL Trento Italy

Purpose This study aims to analyze how different room-committing practices affect the occupancy and profitability of hotels and it critically reviews the role of minimum-length-of-stay (MLOS) requirements given these findings. Design/methodology/approach The approach uses statistical analysis of simplified contexts to develop understanding, and simulations of more complex situations to confirm the relevance in realistic contexts. Findings The study demonstrates that proper solutions of the room-committing problem improve occupancy and profitability, in particular, for hotels working in high-season and high-occupancy situations. Smart committing algorithms diminish the role of MLOS requirements. More demand can be accepted without sacrificing late-arriving long reservations. Originality/value To the best of the authors' knowledge, this work, building upon a previous one cited in this paper, is the first to rigorously study the room-committing problem and to demonstrate its relevance in practical situations and its implications on MLOS rules.

关键词： Hotel management Hotel procedures optimal algorithms Room-committing problem Simulation-based optimization Information technology Optimization

来源：评论

学校读者我要写书评

暂无评论

Norm optimal Iterative Learning Control Applied to Chain Conveyor Systems

引用

IFAC Proceedings Volumes 2001年第14期34卷 95-99页

作者： T. Al-Towaim P. Lewin E. Rogers Dept. of Electronics and Computer Science University of Southampton Southampton SO17 IBJ UK

Norm optimal iterative learning control is an optimization-based approach where, in contrast to other such approaches, a term in the cost function is a measure of the difference between the control vectors used on successive trials. This approach has very well defined theoretical properties and is predicted to give superior performance relative to alternatives when applied to physical processes. In this paper, we describe on-going work towards the implementation of controllers designed using this approach to chain conveyor systems with the eventual aim of examining/verifying performance in 'real world' applications.

关键词： iterative learning control optimal algorithms

来源：评论

学校读者我要写书评

暂无评论

optimal ORDER OF ONE-POINT AND MULTIPOINT ITERATION

引用

JOURNAL OF THE ACM 1974年第4期21卷 643-651页

作者： KUNG, HT TRAUB, JF CARNEGIE MELLON UNIV DEPT COMP SCI PITTSBURGH PA 15213 USA

The problem is to calculate a simple zero of a nonlinear function ƒ by iteration. There is exhibited a family of iterations of order 2n-1 which use n evaluations of ƒ and no derivative evaluations, as well as a second family of iterations of order 2n-1 based on n — 1 evaluations of ƒ and one of ƒ′. In particular, with four evaluations an iteration of eighth order is constructed. The best previous result for four evaluations was fifth *** is proved that the optimal order of one general class of multipoint iterations is 2n-1 and that an upper bound on the order of a multipoint iteration based on n evaluations of ƒ (no derivatives) is *** is conjectured that a multipoint iteration without memory based on n evaluations has optimal order 2n-1.

关键词： computational complexity iteration theory multipoint iterations nonlinear equations optimal algorithms

来源：评论

学校读者我要写书评

暂无评论

Structural Optimization of Dicke-Type Radiometer 2

Structural Optimization of Dicke-Type Radiometer

引用

2nd International Young Scientists Forum on Applied Physics and Engineering (YSF)

作者： Pavlikov, V. V. Zhyla, S. S. Odokienko, O. V. Zhukovsky Natl Aerosp Univ KhAI Aircraft radio Elect Syst design Kharkov Ukraine

ISBN: (纸本)9781467388412

algorithms and block diagrams of signal processing in the Dicke-type radiometer are synthesized on the basis of the theory of optimal statistical decisions and parameters estimates of probabilistic distributions. Limit errors of required parameters estimates in the received optimal algorithms and potential fluctuation sensitivity of the developed block diagrams are investigated.

关键词： microwave radiometry optimal algorithms limit errors of estimates Dicke-type radiometer

来源：评论

学校读者我要写书评

暂无评论

A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks 35

A Framework for Automated Competitive Analysis of On-line Sc...

引用

35th IEEE Real-Time Systems Symposium (RTSS)

作者： Chatterjee, Krishnendu Pavlogiannis, Andreas Koessler, Alexander Schmid, Ulrich IST Austria Inst Sci & Technol Austria Klosterneuburg Austria Vienna Univ Technol Embedded Comp Syst Grp Vienna Austria

ISBN: (纸本)9781479972876

We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a taskset and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. a clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including D-over, that have been proposed in the past, for various tasksets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are tasksets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application.

关键词： scheduling task analysis automated competitive analysis clairvoyant scheduler competitive ratio firm-deadline real-time tasks flexible framework labeled transition system limit-average constraints liveness multiobjective graphs online scheduling algorithms optimal algorithms optional safety Algorithm design and analysis Real-time systems Safety Schedules Scheduling Scheduling algorithms Vectors Scheduling algorithms elastic frame Optimization algorithms Algorithm design and analysis task analysis real-time systems Consumer safety safety IN-LINE

来源：评论

学校读者我要写书评

暂无评论

Quantifying spatial misallocation in centrally provided public goods

引用

ECONOMICS LETTERS 2008年第2期98卷 201-206页

作者： Athreya, Siva Somanathan, Rohini Delhi Sch Econ Delhi India Indian Stat Inst Bangalore 560059 Karnataka India

We use an optimization algorithm to solve a two-period planner's problem of spatially allocating public goods. We apply the algorithm to data on the location of post offices in South India between 1981-1991 and show that more appropriate choices could have reduced travel costs by at least 20%. (c) 2007 Elsevier B.V. All rights reserved.

关键词： public goods optimal algorithms

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT ALGORITHM FOR ADAPTIVE-CONTROL FOR A CLASS OF MIMO PLANT

EFFICIENT ALGORITHM FOR ADAPTIVE-CONTROL FOR A CLASS OF MIMO...

引用

4TH IFAC Symposium on Adaptive Systems in Control and Signal Processing 1992

作者： JUDITSKY, A INRIA IRISAF-35042 RENNESFRANCE

An indirect adaptive control algorithm for a MIMO plant is studied. It is shown that Polyak-Ruppert estimation algorithm along with the simple dead-beat control law constitutes an adaptive control strategy that achiev... 详细信息

ISBN: (纸本)0080417175

关键词： ADAPTIVE CONTROL STOCHASTIC APPROXIMATION optimal algorithms EFFICIENT CONTROL STRATEGIES

来源：评论

学校读者我要写书评

暂无评论

Voting in the Presence of Byzantine Faults 22

Voting in the Presence of Byzantine Faults

引用

IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC)

作者： Tseng, Lewis Univ Illinois Dept Comp Sci Champaign IL 61820 USA

ISBN: (纸本)9781509056521

Voting (or election) algorithms are used widely in many safety-critical systems to mask errors. Most systems only tolerate malicious (or Byzantine) voters - these systems assume the existence of a correct and centralized mechanism to collect the votes and propagate the voting output to each voter. However, in many realistic scenarios, such a centralized voting mechanism is not feasible. Thus, we study the Byzantine voting problem - no centralized mechanism exists in the system, and voters may become Byzantine faulty. We first present impossibility results in both synchronous and asynchronous systems. To circumvent the impossibility results presented in this paper, we propose two relaxed voting properties that are achievable and present optimal voting algorithms that satisfy the relaxed properties. Finally, we show that it is possible to design Byzantine voting algorithms that produce the voting output in one communication step under contention-free scenarios.

关键词： Byzantine Voting optimal algorithms Impossibility Results Distributed algorithms Consensus

来源：评论

学校读者我要写书评

暂无评论

Experimental evaluation of maximum-supply partitioning algorithms for demand-supply graphs

Experimental evaluation of maximum-supply partitioning algor...

引用

18th Workshop on Circuits and Systems

作者： Taoka, S Watanabe, K Watanabe, T Hiroshima Univ Grad Sch Engn Higashihiroshima 7398527 Japan

Let G = (D boolean OR S, E) be an undirected graph with a vertex set D boolean OR S and an (undirected) edge set E, where the vertex set is partitioned into two subsets, a demand vertex set D and a supply vertex set S. We assume that D not equal empty set and S not equal empty set in this paper. Each demand or supply vertex v has a positive real number d(v) or s(v), called the demand or supply of v, respectively. For any subset V' subset of D boolean OR S, the demand of V' is defined by d(V') = Sigma(v is an element of V'boolean AND D) d(v) if V' boolean AND D not equal empty set or d(V') = 0 if V' boolean AND D = empty set. Let s(S) = Sigma(v is an element of S) s(v). Any partition pi = {V-1,..., V-r} (\S\ <= r <= \D boolean OR S\) of D boolean OR S is called a feasible partition of G if and only if pi satisfies the following (1) and (2) for any k = 1,...r: (1) 1 V-k boolean AND S\ <= 1, and (2) if V-k boolean AND S = {u(k)} then the induced subgraph G[V-k] of G is connected and d(V-k) <= s(u(k)). The demand d(pi) of pi is defined by d(pi) = Sigma V-k boolean AND S not equal empty set d(V-k). The "Maximum-Supply Partitioning Problem (MSPP)" is to find a feasible partition pi of G such that d(pi) is maximum among all feasible partitions of G. We implemented not only existing algorithms for obtainity heuristic or optimum solutions to MSPP but also those that are corrected or improved from existing ones. In this paper we show comparison of their capability based on computational experiments.

关键词： graphs partitioning problems heuristic algorithms optimal algorithms demand supply

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：