找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: System Modelling and Optimization; Proceedings of the 1 A. Prékopa,J. Szelezsáan,B. Strazicky Conference proceedings 1986 Springer-Verlag B

[復(fù)制鏈接]
樓主: 切口
21#
發(fā)表于 2025-3-25 06:03:48 | 只看該作者
Discontinuous adaptive control of non minimum phase linear plants,The solution to the problems involved is foreseen by means of the variable structure system theory and of the equivalence between Filippov‘s solution concept with a.e. solution of ordinary differential equation which, as it is well known, has been proved even for a class of systems wider than that of linear plants dealt with in this work.
22#
發(fā)表于 2025-3-25 08:15:42 | 只看該作者
23#
發(fā)表于 2025-3-25 13:17:53 | 只看該作者
Stabilization of the secant method via quasi-newton approach,h respect to linear dependence of the search directions. A short survey of some variants of the secant method, that use quasi-Newton formulas to provide stability, is given. Some parallel algorithms are constructed on the basis of the stable secant approximations.
24#
發(fā)表于 2025-3-25 18:23:54 | 只看該作者
Optimal control as a tool for solving the stationnary Euler equation with periodic boundary conditiem as distributed parameters optimal control problem is first given. This problem is discretized by the Finite Elements Method and solved by conjugate gradient algorithms. In order to set rid of a quadratic state construit several different formulations of the optimal control problem are studied. A quasi-Newton method is also tested.
25#
發(fā)表于 2025-3-25 23:34:53 | 只看該作者
An algorithm for getting a minimum cut-set of a graph,Let x and y be two nodes being not connected by an edge in an undirected connected non-complete graph. We present here an algorithm which finds a minimum cut-set of the graph by which x and y are separated.
26#
發(fā)表于 2025-3-26 02:05:56 | 只看該作者
27#
發(fā)表于 2025-3-26 04:33:24 | 只看該作者
Assignment problems: Recent solution methods and applications,Recent developments for linear and quadratic assignment problems are surveyed. In particular some new efficient solution techniques are outlined and a recent application concerning the assignment of time-slots in a time division multiple access system is described. Finally assignment problems are used to solve a problem in channel routing.
28#
發(fā)表于 2025-3-26 12:18:38 | 只看該作者
O. P. Burdakoythe ‘ideal’ architecture of a software platform. The third workshop on software ecosystems focuses on the management of software ecosystems, i.e., how a software vendor can manage its network of partners, developers, service deliverers, and other third parties that play a role in the software ecosys
29#
發(fā)表于 2025-3-26 15:42:24 | 只看該作者
Rainer E. Burkardthe ‘ideal’ architecture of a software platform. The third workshop on software ecosystems focuses on the management of software ecosystems, i.e., how a software vendor can manage its network of partners, developers, service deliverers, and other third parties that play a role in the software ecosys
30#
發(fā)表于 2025-3-26 18:09:35 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-5 10:42
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
靖宇县| 应城市| 正镶白旗| 龙川县| 山西省| 开平市| 万载县| 高平市| 东乡县| 泉州市| 阳东县| 隆安县| 延安市| 凉山| 玛曲县| 波密县| 华坪县| 普定县| 古丈县| 平舆县| 扬中市| 额尔古纳市| 德化县| 兴海县| 古丈县| 连山| 阳新县| 乌审旗| 绥中县| 修武县| 乳源| 仙居县| 西宁市| 睢宁县| 广汉市| 张家口市| 社旗县| 绥江县| 藁城市| 丰城市| 武冈市|