咨询与建议

限定检索结果

文献类型

  • 146 篇 期刊文献
  • 24 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 126 篇 工学
    • 100 篇 计算机科学与技术...
    • 39 篇 电气工程
    • 22 篇 软件工程
    • 17 篇 控制科学与工程
    • 15 篇 信息与通信工程
    • 4 篇 机械工程
    • 3 篇 力学(可授工学、理...
    • 1 篇 动力工程及工程热...
    • 1 篇 电子科学与技术(可...
    • 1 篇 化学工程与技术
    • 1 篇 航空宇航科学与技...
    • 1 篇 环境科学与工程(可...
  • 79 篇 理学
    • 75 篇 数学
    • 4 篇 系统科学
    • 3 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 27 篇 管理学
    • 23 篇 管理科学与工程(可...
    • 4 篇 工商管理
    • 4 篇 图书情报与档案管...
  • 5 篇 经济学
    • 4 篇 应用经济学
    • 1 篇 理论经济学

主题

  • 170 篇 optimal algorith...
  • 15 篇 parallel algorit...
  • 11 篇 complexity
  • 8 篇 computational co...
  • 7 篇 scheduling
  • 6 篇 lower bounds
  • 5 篇 stochastic appro...
  • 5 篇 computational ge...
  • 5 篇 dynamic programm...
  • 5 篇 heuristic algori...
  • 4 篇 erew pram
  • 4 篇 system identific...
  • 4 篇 optimization
  • 4 篇 unbounded search
  • 4 篇 erew-pram
  • 4 篇 global optimizat...
  • 4 篇 efficient contro...
  • 4 篇 nonlinear equati...
  • 4 篇 vlsi
  • 4 篇 adaptive control

机构

  • 4 篇 chongqing univ c...
  • 4 篇 old dominion uni...
  • 4 篇 columbia univ de...
  • 3 篇 northeastern uni...
  • 3 篇 univ kentucky de...
  • 2 篇 irisa/inria camp...
  • 2 篇 carleton univ sc...
  • 2 篇 calif state univ...
  • 2 篇 columbia univ de...
  • 2 篇 fordham univ dep...
  • 2 篇 shanghai jiao to...
  • 2 篇 univ illinois co...
  • 2 篇 elizabeth city s...
  • 2 篇 dept. of electro...
  • 2 篇 natl chiao tung ...
  • 2 篇 inria irisa f-35...
  • 2 篇 politecn torino ...
  • 1 篇 columbia univers...
  • 1 篇 nanjing univ pos...
  • 1 篇 old dominion uni...

作者

  • 10 篇 olariu s
  • 4 篇 schwing jl
  • 4 篇 zilinskas antana...
  • 4 篇 werschulz ag
  • 4 篇 reingold em
  • 4 篇 zhuge qingfeng
  • 4 篇 drezner zvi
  • 4 篇 wong ck
  • 4 篇 jiang weiwen
  • 4 篇 chen xianzhang
  • 4 篇 preparata fp
  • 3 篇 wozniakowski h
  • 3 篇 e. rogers
  • 3 篇 bilardi g
  • 3 篇 sha edwin h. -m.
  • 3 篇 dabbene fabrizio
  • 3 篇 sznaier mario
  • 3 篇 wasilkowski gw
  • 3 篇 tempo roberto
  • 2 篇 juditsky a

语言

  • 157 篇 英文
  • 13 篇 其他
检索条件"主题词=optimal algorithms"
170 条 记 录,以下是31-40 订阅
排序:
optimal adaptive solution of initial-value problems with unknown singularities
收藏 引用
JOURNAL OF COMPLEXITY 2008年 第4期24卷 455-476页
作者: Kacewicz, Boleslaw Przybylowicz, Pawel AGH Univ Sci & Technol Dept Appl Math PL-30059 Krakow Poland
The optima of solution of initial-value problems in ODES is well studied for smooth right-hand Side functions. Much less is known about the optimality, of algorithms for singular problems. In this paper. We Study the ... 详细信息
来源: 评论
optimal Functional-Unit Assignment for Heterogeneous Systems Under Timing Constraint
收藏 引用
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2017年 第9期28卷 2567-2580页
作者: Jiang, Weiwen Sha, Edwin Hsing-Mean Chen, Xianzhang Yang, Lei Zhou, Lei Zhuge, Qingfeng Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China
In high-level synthesis for real-time systems, it typically employs heterogeneous functional-unit types to achieve high-performance and low-cost designs. In the design phase, it is critical to determine which function... 详细信息
来源: 评论
On the worst-case optimal multi-objective global optimization
收藏 引用
OPTIMIZATION LETTERS 2013年 第8期7卷 1921-1928页
作者: Zilinskas, Antanas Inst Math & Informat LT-08663 Vilnius Lithuania
Multi-objective optimization problem with Lipshitz objective functions is considered. It is shown that the worst-case optimal passive algorithm can be reduced to the computation of centers of balls producing the optim... 详细信息
来源: 评论
On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
收藏 引用
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2016年 第Jun.期35卷 123-136页
作者: Zilinskas, Antanas Gimbutiene, Grazina Vilnius State Univ Inst Math & Informat LT-08663 Vilnius Lithuania
The bi-objective Lipschitz optimization with univariate objectives is considered. The concept of the tolerance of the lower Lipschitz bound over an interval is generalized to arbitrary subintervals of the search regio... 详细信息
来源: 评论
optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
收藏 引用
LINEAR ALGEBRA AND ITS APPLICATIONS 2008年 第8-9期429卷 2052-2066页
作者: Oseledets, Ivan Russian Acad Sci Inst Numer Math Moscow 119333 Russia
We propose two exhaustive search-type methods for the construction of Karatsuba-like algorithms for fast computation of certain bilinear forms in GF(2). The computation is done via an explicit construction of trilinea... 详细信息
来源: 评论
An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
收藏 引用
COMPUTING 2006年 第4期78卷 311-328页
作者: Dostal, Z. Tech Univ Ostrava Ostrava 70833 Czech Republic
An implementation of the recently proposed semi-monotonic augmented Lagrangian algorithm for solving the large convex bound and equality constrained quadratic programming problems is considered. It is proved that if t... 详细信息
来源: 评论
An optimal algorithm for Global Optimization and adaptive covering
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2016年 第3期66卷 535-572页
作者: Shishkin, Serge L. Finn, Alan M. United Technol Res Ctr 411 Silver LaneMS 129-15 E Hartford CT 06447 USA
The general class of zero-order Global Optimization problems is split into subclasses according to a proposed "Complexity measure" and the computational complexity of each subclass is rigorously estimated. T... 详细信息
来源: 评论
AN optimal LINKED LIST PREFIX ALGORITHM ON A LOCAL MEMORY COMPUTER
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1991年 第10期40卷 1149-1153页
作者: HAN, YJ Dept. of Comput. Sci. Kentucky Univ. Lexington KY USA Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions n elements in time O(n/p+log n) on a local memory PRAM model ..." property="og:description">
We present a deterministic parallel algorithm for the linked list prefix problem. It computes linked list prefix for an input list of n elements in time O(n/p + log n) on a local memory PRAM model using p processors a... 详细信息
来源: 评论
optimal MULTISTAGE ALGORITHM FOR ADJOINT COMPUTATION
收藏 引用
SIAM JOURNAL ON SCIENTIFIC COMPUTING 2016年 第3期38卷 C232-C255页
作者: Aupy, Guillaume Herrmann, Julien Hovland, Paul Robert, Yves ENS Lyon INRIA LIP F-69364 Lyon 07 France Vanderbilt Univ 221 Kirkland Hall Nashville TN 37235 USA Argonne Natl Lab 9700 S Cass Ave Argonne IL 60439 USA Univ Tennessee Knoxville TN 37996 USA
We reexamine the work of Stumm and Walther on multistage algorithms for adjoint computation. We provide an optimal algorithm for this problem when there are two levels of checkpoints, in memory and on disk. Previously... 详细信息
来源: 评论
Finding optimal solutions to several gray pattern instances
收藏 引用
OPTIMIZATION LETTERS 2022年 第2期16卷 713-722页
作者: Drezner, Zvi Kalczynski, Pawel Misevicius, Alfonsas Palubeckis, Gintaras Calif State Univ Fullerton Coll Business & Econ Fullerton CA 92834 USA Kaunas Univ Technol Dept Multimedia Engn Kaunas Lithuania
In this paper we compare two new binary linear formulations to a standard quadratic binary program for the gray pattern problem and solved all three by the Gurobi solver. One formulation performed significantly better... 详细信息
来源: 评论