咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 34 篇 工学
    • 23 篇 计算机科学与技术...
    • 17 篇 电气工程
    • 7 篇 信息与通信工程
    • 4 篇 控制科学与工程
    • 3 篇 软件工程
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 生物工程
    • 1 篇 网络空间安全
  • 16 篇 理学
    • 14 篇 数学
    • 2 篇 生物学
  • 9 篇 管理学
    • 9 篇 管理科学与工程(可...
  • 2 篇 医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 临床医学

主题

  • 41 篇 polynomial time ...
  • 6 篇 implicit computa...
  • 5 篇 linear logic
  • 5 篇 computational co...
  • 5 篇 linear programmi...
  • 3 篇 approximation al...
  • 3 篇 lambda-calculus
  • 3 篇 algorithm
  • 2 篇 type systems
  • 2 篇 polynomial appro...
  • 2 篇 isomorphism
  • 2 篇 computational ge...
  • 2 篇 light linear log...
  • 2 篇 learning complex...
  • 2 篇 feedforward nets
  • 2 篇 undirected graph
  • 2 篇 type inference
  • 2 篇 characterization
  • 2 篇 complexity theor...
  • 2 篇 polynomials

机构

  • 2 篇 tel aviv acad co...
  • 2 篇 northwestern pol...
  • 2 篇 chinese acad sci...
  • 2 篇 southwestern uni...
  • 1 篇 department of el...
  • 1 篇 naval postgrad s...
  • 1 篇 columbia univ de...
  • 1 篇 univ oslo dept m...
  • 1 篇 pázmány péter ca...
  • 1 篇 univ rennes insa...
  • 1 篇 northeastern uni...
  • 1 篇 univ angers fac ...
  • 1 篇 decodegenetics s...
  • 1 篇 univ calif santa...
  • 1 篇 univ verona dept...
  • 1 篇 translat genom r...
  • 1 篇 kharkov natl uni...
  • 1 篇 san francisco st...
  • 1 篇 univ paris 13 cn...
  • 1 篇 univ paris 13 cn...

作者

  • 4 篇 baillot patrick
  • 2 篇 terui kazushige
  • 2 篇 zheng sq
  • 2 篇 zhang peng
  • 2 篇 ben-amram amir m...
  • 2 篇 fang can
  • 2 篇 fu cheng
  • 2 篇 roy a
  • 1 篇 roubellat f
  • 1 篇 murad william
  • 1 篇 li tongtong
  • 1 篇 gonzalez tf
  • 1 篇 haddou mounir
  • 1 篇 hwang euiseok
  • 1 篇 freund rm
  • 1 篇 evain laurent
  • 1 篇 shao zi yun
  • 1 篇 yen ten-yang
  • 1 篇 hao zhifeng
  • 1 篇 blanton ronald d...

语言

  • 37 篇 英文
  • 4 篇 其他
检索条件"主题词=polynomial time complexity"
41 条 记 录,以下是1-10 订阅
排序:
Linear, polynomial or exponential? complexity inference in polynomial time
Linear, polynomial or exponential? Complexity inference in p...
收藏 引用
4th Conference on Computability in Europe (CiE 2008)
作者: Ben-Amram, Amir M. Jones, Neil D. Kristiansen, Lars Tel Aviv Acad Coll Sch Comp Sci Tel Aviv Israel Univ Copenhagen DIKU DK-1168 Copenhagen Denmark Univ Oslo Dept Math N-0316 Oslo Norway
We present a new method for inferring complexity properties for imperative programs with bounded loops. The properties handled are: polynomial (or linear) boundedness of computed values, as a function of the input;and... 详细信息
来源: 评论
The complexity of Checking Consistency of Pedigree Information and Related Problems
收藏 引用
Journal of Computer Science & Technology 2004年 第1期19卷 42-59页
作者: LucaAceto JensA.Hansen AnnaIngdlfsddttir JacobJohnsen JohnKnudsen BasicResearchinComputerScience CentreoftheDanishNationalResearchFoundationDepartmentofComputerScienceAalborgUniversityFr.Bajersvej7E9220AalborgΦDenmark deCODEGenetics Sturlugata8101ReykjavikIceland
Consistency checking is a fundamental computational problem in *** a pedigree and information on the genotypes (of some) of the individuals in it, the aim ofconsistency checking is to determine whether these data are ... 详细信息
来源: 评论
Combining linear logic and size types for implicit complexity
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 813卷 70-99页
作者: Baillot, Patrick Ghyselen, Alexis Univ Claude Bernard Lyon I Univ Lyon CNRS ENS Lyon F-69342 Lyon 07 France
Several type systems have been proposed to statically control the time complexity of lambda-calculus programs and characterize complexity classes such as FPtime or FEXPtime. A first line of research stems from linear ... 详细信息
来源: 评论
TRUDA: a truthful auction mechanism with non-uniform payment for heterogeneous spectrum access in wireless networks
收藏 引用
IET COMMUNICATIONS 2017年 第14期11卷 2214-2220页
作者: Zhang, Yonglong Li, Bin Qin, Haiyan Yangzhou Univ Coll Informat Engn Yangzhou 225127 Jiangsu Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Jiangsu Peoples R China
Auction is a highly effective trading form for distributing resource among buyers in a market at competitive prices, and has been applied to many domains, e.g. spectrum allocation in wireless networks and the virtual ... 详细信息
来源: 评论
Iterative generation of higher-order nets in polynomial time using linear programming
收藏 引用
IEEE TRANSACTIONS ON NEURAL NETWORKS 1997年 第2期8卷 402-412页
作者: Roy, A Mukhopadhyay, S Laboratory of Chromatography DEPg.Fac.Quimica Universidad Nacional Autonoma de Mexico Circuito interior Cd Universitaria/CP 04510 Mexico D.F.Mexico
This paper presents an algorithm for constructing and training a class of higher-order perceptrons for classification problems. The method uses linear programming models to construct and train the net, Its polynomial ... 详细信息
来源: 评论
A temporal segmentation algorithm for restoring the controllability of networked control systems
收藏 引用
IET CONTROL THEORY AND APPLICATIONS 2022年 第3期16卷 318-329页
作者: Cui, Yulong Wu, Mincheng Shao, Cunqi He, Shibo Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Peoples R China
Restoring the controllability of networked control systems is a fundamental issue that needs to be settled, especially when malicious attacks or malfunctions occur. Previous studies tried to address such an issue by a... 详细信息
来源: 评论
EVIDENCE-BASED RECOGNITION OF 3-D OBJECTS
收藏 引用
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1988年 第6期10卷 783-802页
作者: JAIN, AK HOFFMAN, R NORTHROP CORP CTR RES & TECHNOL AUTOMAT SCI GRP PALOS VERDES PENINSULA CA 90274 USA
An evidence-based recognition technique is defined that identifies 3-D objects by looking for their notable features. This technique makes use of an evidence rule base, which is a set of salient or evidence conditions... 详细信息
来源: 评论
An Approach to Forming Optimal Design Structures on the Basis of the Ranking Method of Solving Nonlinear Boolean Equations
收藏 引用
JOURNAL OF AUTOMATION AND INFORMATION SCIENCES 2011年 第10期43卷 42-55页
作者: Listrovoy, S. V. Minukhin, S. V. Ukrainian State Acad Railway Transport Kharkov Ukraine Kharkov Natl Univ Econ Kharkov Ukraine
The new problem statement of formalizing the choice of the optimal design structure of an organization, which is based on the modern methodology of developing complex software systems, reduced to nonlinear Boolean equ... 详细信息
来源: 评论
Light types for polynomial time computation in lambda calculus
收藏 引用
INFORMATION AND COMPUTATION 2009年 第1期207卷 41-62页
作者: Baillot, Patrick Terui, Kazushige Univ Paris 13 CNRS UMR 7030 LIPN F-93430 Villetaneuse France Kyoto Univ Math Sci Res Inst Kyoto 6068501 Japan
We present a polymorphic type system for lambda calculus ensuring that well-typed programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intui... 详细信息
来源: 评论
A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2000年 第2期127卷 297-316页
作者: Artigues, C Roubellat, F Univ Avignon & Pays Vaucluse Lab Informat Avignon F-84911 Avignon 9 France CNRS Lab Anal & Architecture Syst F-31077 Toulouse France
In this paper, a polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints, general precedence relations and multiple modes is proposed. Insertion objective is to minimize the re... 详细信息
来源: 评论