咨询与建议

限定检索结果

文献类型

  • 35 篇 期刊文献
  • 1 篇 会议

馆藏范围

  • 36 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 27 篇 理学
    • 26 篇 数学
    • 2 篇 物理学
  • 18 篇 工学
    • 15 篇 计算机科学与技术...
    • 5 篇 电气工程
    • 4 篇 软件工程
    • 2 篇 信息与通信工程
    • 1 篇 控制科学与工程
    • 1 篇 航空宇航科学与技...
  • 8 篇 管理学
    • 7 篇 管理科学与工程(可...
    • 1 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 36 篇 complexity of al...
  • 3 篇 short-step prima...
  • 3 篇 interior point m...
  • 2 篇 algorithms
  • 2 篇 np-complete prob...
  • 2 篇 author keywords
  • 1 篇 68c25
  • 1 篇 biological seque...
  • 1 篇 computer science
  • 1 篇 real-time predic...
  • 1 篇 linear optimizat...
  • 1 篇 idempotent mathe...
  • 1 篇 maximal set
  • 1 篇 rate of converge...
  • 1 篇 semidefinite opt...
  • 1 篇 proportion exten...
  • 1 篇 phased-array rad...
  • 1 篇 program length
  • 1 篇 e.1 data structu...
  • 1 篇 least squares ap...

机构

  • 2 篇 univ ferhat abba...
  • 1 篇 univ fed flumine...
  • 1 篇 russian acad sci...
  • 1 篇 univ new s wales...
  • 1 篇 univ washington ...
  • 1 篇 univ western aus...
  • 1 篇 embry riddle aer...
  • 1 篇 applied mathemat...
  • 1 篇 univ augsburg in...
  • 1 篇 univ ferhat abba...
  • 1 篇 univ nantes umr ...
  • 1 篇 univ ferhat abba...
  • 1 篇 univ waterloo de...
  • 1 篇 indian inst mana...
  • 1 篇 taras shevchenko...
  • 1 篇 helsinki univ te...
  • 1 篇 aplus design tec...
  • 1 篇 laboratoire de m...
  • 1 篇 florida int univ...
  • 1 篇 russian acad sci...

作者

  • 3 篇 achache mohamed
  • 1 篇 ciobanu laura
  • 1 篇 pan pc
  • 1 篇 wells rs
  • 1 篇 cherepnev mikhai...
  • 1 篇 m. r. garey
  • 1 篇 snider ad
  • 1 篇 protti fabio
  • 1 篇 buy d. b.
  • 1 篇 goutali moufida
  • 1 篇 tarhio jorma
  • 1 篇 perera sirani m.
  • 1 篇 pager d
  • 1 篇 houcine abdereza...
  • 1 篇 ghose s
  • 1 篇 abramov s. a.
  • 1 篇 maier d
  • 1 篇 gajski dd
  • 1 篇 pan pengxiang
  • 1 篇 chen jing-chao

语言

  • 33 篇 英文
  • 3 篇 其他
检索条件"主题词=Complexity Of Algorithms"
36 条 记 录,以下是11-20 订阅
排序:
complexity Analysis of an Interior Point Algorithm for the Semidefinite Optimization Based on a Kernel Function with a Double Barrier Term
收藏 引用
Acta Mathematica Sinica,English Series 2015年 第3期31卷 543-556页
作者: Mohamed ACHACHE Laboratoire de Mathématiques Fondamentales et Numériques Faculté des Sciences Université Ferhat Abbas Sétif 1Algérie
In this paper, we establish the polynomial complexity of a primal-dual path-following interior point algorithm for solving semidefinite optimization(SDO) problems. The proposed algorithm is based on a new kernel fun... 详细信息
来源: 评论
complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO
收藏 引用
NUMERICAL algorithms 2015年 第2期70卷 393-405页
作者: Achache, Mohamed Goutali, Moufida Univ Ferhat Abbas Setif1 Lab Math Fondamentales & Numer Setif Algeria Univ Ferhat Abbas Setif1 Fac Sci Dept Math Setif Algeria
In this paper, we present a primal-dual interior point algorithm for linearly constrained convex optimization (LCCO). The algorithm uses only full-Newton step to update iterates with an appropriate proximity measure f... 详细信息
来源: 评论
A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP
收藏 引用
AFRIKA MATEMATIKA 2015年 第1-2期26卷 139-151页
作者: Achache, Mohamed Khebchache, Radia Univ Ferhat Abbas Setif1 Lab Math Fondament & Numer Setif Algeria Univ Ferhat Abbas Setif1 Fac Sci Dept Math Setif Algeria
In this paper, we propose a weighted short-step primal-dual interior point algorithm for solving monotone linear complementarity problem (LCP). The algorithm uses at each interior point iteration a full-Newton step an... 详细信息
来源: 评论
Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2014年 第1期223卷 155-171页
作者: Dourado, Mitre C. Oliveira, Rodolfo A. Protti, Fabio Univ Fed Rio de Janeiro Rio De Janeiro Brazil Univ Fed Fluminense Niteroi RJ Brazil
For a set of vertices of a connected graph , a Steiner W-tree is a connected subgraph of such that and is minimum. Vertices in are called terminals. In this work, we design an algorithm for the enumeration of all Stei... 详细信息
来源: 评论
LINK REVERSAL ROUTING WITH BINARY LINK LABELS: WORK complexity
收藏 引用
SIAM JOURNAL ON COMPUTING 2013年 第2期42卷 634-661页
作者: Charron-Bost, Bernadette Gaillard, Antoine Welch, Jennifer L. Widder, Josef Ecole Polytech CNRS LIX F-91128 Palaiseau France Ecole Polytech LIX F-91128 Palaiseau France Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA TU Wien Formal Methods Syst Engn Grp A-1040 Vienna Austria
Full Reversal and Partial Reversal are two well-known routing algorithms that were introduced by Gafni and Bertsekas [IEEE Trans. Commun., 29 (1981), pp. 11-18]. By reversing the directions of some links of the graph,... 详细信息
来源: 评论
Approximate Boyer-Moore String Matching for Small Alphabets
收藏 引用
ALGORITHMICA 2010年 第3期58卷 591-609页
作者: Salmela, Leena Tarhio, Jorma Kalsi, Petri Helsinki Univ Technol Dept Comp Sci & Engn Espoo 02015 Finland
Recently a new variation of approximate Boyer-Moore string matching was presented for the k-mismatch problem. The variation, called FAAST, is specifically tuned for small alphabets. We further improve this algorithm g... 详细信息
来源: 评论
The monomorphism problem in free groups
收藏 引用
ARCHIV DER MATHEMATIK 2010年 第5期94卷 423-434页
作者: Ciobanu, Laura Houcine, Abderezak Ould Univ Fribourg CH-1700 Fribourg Switzerland Univ Mons B-7000 Mons Belgium Univ Lyon 1 INSA Lyon F-69621 Villeurbanne France Univ Lyon 1 CNRS Ecole Cent Lyon Inst Camille JordanUMR5208 F-69622 Villeurbanne France
Let F be a free group of finite rank. We say that the monomorphism problem in F is decidable if there is an algorithm such that, for any two elements u and v in F, it determines whether there exists a monomorphism of ... 详细信息
来源: 评论
BURST-ERROR CORRECTION FOR CYCLIC CODES
BURST-ERROR CORRECTION FOR CYCLIC CODES
收藏 引用
International IEEE Conference Devoted to the 150-Anniversary of Alexander S Popov
作者: Semerenko, Vasyl P.
The methods of burst-error correction for cyclic (n, k) codes based on the mathematical theory of linear finite-state machines (LFSM) are considered. The algorihtm of sparse error burst correction of length no more th... 详细信息
来源: 评论
Efficient sample sort and the average case analysis of PEsort
收藏 引用
THEORETICAL COMPUTER SCIENCE 2006年 第1-3期369卷 44-66页
作者: Chen, Jing-Chao DongHua Univ Sch Informat Shanghai 200051 Peoples R China
The purpose of the paper is twofold. First, we want to search for a more efficient sample sort. Secondly, by analyzing a variant of Samplesort, we want to settle an open problem: the average case analysis of Proportio... 详细信息
来源: 评论
complexity of a noninterior path-following method for the linear complementarity problem
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2002年 第1期112卷 53-76页
作者: Burke, J Xu, S Univ Washington Dept Math Seattle WA 98195 USA Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada
We study the complexity of a noninterior path-following method for the linear complementarity problem. The method is based on the Chen-Harker-Kanzow-Smale smoothing function. It is assumed that the matrix M is either ... 详细信息
来源: 评论