咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是1-10 订阅
排序:
Randomized and optimal algorithms for k-Lifetime Dominating Set in Wireless Sensor Networks
收藏 引用
IEEE ACCESS 2022年 10卷 23774-23784页
作者: Luo, Weizhong Liang, Junbin Wang, Tianshu Huizhou Univ Sch Comp Sci & Engn Huizhou 516007 Guangdong Peoples R China Guangxi Univ Sch Comp & Elect Informat Guangxi Key Lab Multimedia Commun & Network Techn Nanning 530004 Peoples R China Neusoft Grp Co Ltd Nanning 530004 Peoples R China
In wireless sensor networks, rotating dominating set is an efficient method for balancing the energy consumption of nodes, and thereby extending the network operational time. This method can be abstracted as k-Lifetim... 详细信息
来源: 评论
Efficient and optimal algorithms for Contextual Dueling Bandits under Realizability  33
Efficient and Optimal Algorithms for Contextual Dueling Band...
收藏 引用
33rd International Conference on Algorithmic Learning Theory (ALT)
作者: Saha, Aadirupa Krishnamurthy, Akshay Microsoft Res New York NY 10012 USA
We study the K-armed contextual dueling bandit problem, a sequential decision making setting in which the learner uses contextual information to make two decisions, but only observes preference-based feedback suggesti... 详细信息
来源: 评论
optimal algorithms for doubly weighted approximation of univariate functions
收藏 引用
JOURNAL OF APPROXIMATION THEORY 2016年 201卷 30-47页
作者: Kuo, F. Y. Plaskota, L. Wasilkowski, G. W. Univ New S Wales Sch Math & Stat Sydney NSW 2052 Australia Univ Warsaw Fac Math Informat & Mech PL-02097 Warsaw Poland Univ Kentucky Dept Comp Sci Lexington KY 40506 USA
We consider a rho-weighted L-q approximation in the space of univariate functions f : R+ -> R with finite parallel to f((r)) psi parallel to L-p. Let alpha = r - 1/p + 1/q and omega = rho/psi. Assuming that psi and... 详细信息
来源: 评论
optimal algorithms for Universal Random Number Generation From Finite Memory Sources
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2015年 第3期61卷 1277-1297页
作者: Seroussi, Gadiel Weinberger, Marcelo J. Univ Republica Montevideo 11100 Uruguay Stanford Univ Ctr Sci Informat Stanford CA 94305 USA
We study random number generators (RNGs), both in the fixed to variable-length (FVR) and the variable to fixed-length (VFR) regimes, in a universal setting in which the input is a finite memory source of arbitrary ord... 详细信息
来源: 评论
optimal algorithms in a Krylov subspace for solving linear inverse problems by MFS
收藏 引用
ENGINEERING ANALYSIS WITH BOUNDARY ELEMENTS 2014年 44卷 64-75页
作者: Liu, Chein-Shan Natl Taiwan Univ Dept Civil Engn Taipei 10617 Taiwan
The method of fundamental solutions (MFS) is used to solve backward heat conduction problem, inverse heat source problem, inverse Cauchy problem and inverse Robin problem. In order to overcome the ill-posedness of res... 详细信息
来源: 评论
Move-optimal arbitrary pattern formation by mobile robots on rectangular grid using near-optimal spatial area
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1038卷
作者: Sharma, Avisek Ghosh, Satakshi Goswami, Pritam Sau, Buddhadeb Jadavpur Univ Dept Math Kolkata 700032 West Bengal India Int Inst Informat Technol IIIT Bhubaneswar Dept Basic Sci & Humanities Bhubaneswar 751003 Odisha India Sister Nivedita Univ Dept Comp Sci & Engn Kolkata 700156 West Bengal India
Arbitrary pattern formation (APF) is a well-studied problem in swarm robotics. To the best of our knowledge, the problem has been considered in two different settings: one in a euclidean plane and another in an infini... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Minimum consistent subset of simple graph classes
收藏 引用
DISCRETE APPLIED MATHEMATICS 2023年 第1期338卷 255-277页
作者: Dey, Sanjana Maheshwari, Anil Nandy, Subhas C. Indian Stat Inst ACM Unit Kolkata India Carleton Univ Sch Comp Sci Ottawa ON Canada
In the minimum consistent subset (MCS) problem, a connected simple undirected graph G = (V, E) is given whose each vertex is colored by one of the colors {c1, c2, ... , ck}, and the objective is to compute a minimum s... 详细信息
来源: 评论
Obnoxious facility location in multiple dimensional space
收藏 引用
TOP 2023年 第2期31卷 331-354页
作者: Kalczynski, Pawel Suzuki, Atsuo Drezner, Zvi Calif State Univ Fullerton Coll Business & Econ Fullerton CA 92834 USA Nanzan Univ Dept Data Sci Nagoya Aichi 4668673 Japan
The obnoxious facility location problem in three dimensions is optimally solved by an exact method based on Apollonius spheres, and in three or more dimensions by a modification of the Big-Cube-Small-Cube (BCSC, Schob... 详细信息
来源: 评论
An excellent derivative-free multiple-zero finding numerical technique of optimal eighth order convergence
收藏 引用
Annali dell'Universita di Ferrara 2022年 第1期68卷 161-186页
作者: Sharma, Janak Raj Kumar, Sunil Department of Mathematics Sant Longowal Institute of Engineering and Technology Sangrur Longowal 148106 India Department of Mathematics Amrita School of Engineering Amrita Vishwa Vidyapeetham Channai 601103 India
A number of higher order Newton-like methods (i.e. the methods requiring both function and derivative evaluations) are available in literature for multiple zeros of a nonlinear function. However, higher order Traub-St... 详细信息
来源: 评论