咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 13 篇 理学
    • 7 篇 数学
    • 5 篇 物理学
    • 1 篇 化学
    • 1 篇 生物学
    • 1 篇 统计学(可授理学、...
  • 9 篇 工学
    • 7 篇 计算机科学与技术...
    • 2 篇 电子科学与技术(可...
    • 1 篇 仪器科学与技术
    • 1 篇 电气工程
    • 1 篇 信息与通信工程
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 16 篇 computational-co...
  • 4 篇 complexity class...
  • 2 篇 model
  • 2 篇 monte-carlo
  • 2 篇 algorithm
  • 2 篇 geometry
  • 1 篇 docking
  • 1 篇 deletions
  • 1 篇 computer
  • 1 篇 aperture-angle
  • 1 篇 principle
  • 1 篇 edges
  • 1 篇 trees
  • 1 篇 2 variables
  • 1 篇 inference engine...
  • 1 篇 minimum descript...
  • 1 篇 terminological r...
  • 1 篇 multirate
  • 1 篇 programs
  • 1 篇 satisfiability p...

机构

  • 2 篇 univ roma la sap...
  • 1 篇 departamento de ...
  • 1 篇 max planck inst ...
  • 1 篇 school of comput...
  • 1 篇 univ roma la sap...
  • 1 篇 univ aquila dipa...
  • 1 篇 univ rome dipart...
  • 1 篇 univ calif san d...
  • 1 篇 univ warwick dep...
  • 1 篇 univ edinburgh d...
  • 1 篇 univ akron akron...
  • 1 篇 univ calif san d...
  • 1 篇 dfki gmbh german...
  • 1 篇 []department of ...
  • 1 篇 univ innsbruck i...
  • 1 篇 inst natl rech i...
  • 1 篇 austrian acad sc...
  • 1 篇 moscow mv lomono...
  • 1 篇 pct umr gulliver...
  • 1 篇 w virginia univ ...

作者

  • 1 篇 lenka zdeborová
  • 1 篇 goldberg leslie ...
  • 1 篇 martin weigel
  • 1 篇 marchetti-spacca...
  • 1 篇 tsinghua univers...
  • 1 篇 jerrum mark
  • 1 篇 bruton leonard t...
  • 1 篇 omaña-pulido els...
  • 1 篇 vianu v
  • 1 篇 lenzerini m
  • 1 篇 brooks j. paul
  • 1 篇 duer w.
  • 1 篇 nutt w
  • 1 篇 donini fm
  • 1 篇 frigioni d
  • 1 篇 van den nest m.
  • 1 篇 china
  • 1 篇 toussaint godfri...
  • 1 篇 dynnikov ia
  • 1 篇 florent krząkała

语言

  • 15 篇 英文
  • 1 篇 其他
检索条件"主题词=computational-complexity"
16 条 记 录,以下是1-10 订阅
排序:
Reducing the Multiplier-complexity of Massively Parallel Polyphase 2D IIR Broadband Beam Filters
收藏 引用
CIRCUITS SYSTEMS AND SIGNAL PROCESSING 2012年 第3期31卷 1229-1243页
作者: Madanayake, Arjuna Gunaratne, Thushara K. Bruton, Leonard T. Univ Akron Akron OH 44325 USA Univ Calgary Calgary AB T2N 1N4 Canada
The superior broadband performance of 2D IIR frequency-planar beam filters, relative to conventional 2D FIR true-time-delay beamforming, has recently been reported using computational electromagnetics and real-time em... 详细信息
来源: 评论
A Novel Approach for WLAN-based Outdoor Fingerprinting Localization
A Novel Approach for WLAN-based Outdoor Fingerprinting Local...
收藏 引用
2011 IEEE 3rd International Conference on Communication Software and Networks(ICCSN 2011)
作者: Qingyuan Zhao Sheng Zhang Jinguo Quan and Xiaokang Lin Modern communication laboratory Graduate School at Shenzhen Tsinghua University Shenzhen 518055 China
These years, WLAN- based positioning technology developed rapidly due to the limitation of GPS in "city canyon". Some people try to apply the indoor fingerprint positioning technology in the outdoor environm... 详细信息
来源: 评论
Classical spin systems and the quantum stabilizer formalism: General mappings and applications
收藏 引用
JOURNAL OF MATHEMATICAL PHYSICS 2009年 第8期50卷 083303:1-083303:35页
作者: Huebener, R. Van den Nest, M. Duer, W. Briegel, H. J. Univ Innsbruck Inst Theoret Phys A-6020 Innsbruck Austria Max Planck Inst Quantum Opt D-85748 Garching Germany Austrian Acad Sci Inst Quantenopt & Quanteninformat A-6020 Innsbruck Austria
We present general mappings between classical spin systems and quantum physics. More precisely, we show how to express partition functions and correlation functions of arbitrary classical spin models as inner products... 详细信息
来源: 评论
The complexity of ferromagnetic ising with local fields
收藏 引用
COMBINATORICS PROBABILITY & COMPUTING 2007年 第1期16卷 43-61页
作者: Goldberg, Leslie Ann Jerrum, Mark Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England Univ Edinburgh Div Informat JCMB Edinburgh EH9 3JZ Midlothian Scotland
We consider the complexity of approximating the partition function of the ferromagnetic Ising model with varying interaction energies and local external magnetic fields. Jerrum and Sinclair provided a fully polynomial... 详细信息
来源: 评论
Measurable notions of complexity and their relationship to biological complexity
收藏 引用
CHEMISTRY & BIODIVERSITY 2007年 第11期4卷 2656-2669页
作者: Brooks, J. Paul Virginia Commonwealth Univ Operat Res & Ctr Study Biol Compplexity Dept Stat Sci Richmond VA 23284 USA
complexity is often invoked as a motivation for a systems approach to biology. We review three measurable notions of complexity from the areas of computation and data analysis. These measures have each led to mathemat... 详细信息
来源: 评论
Phase transitions in the coloring of random graphs
收藏 引用
Physical Review E 2007年 第3期76卷 031131-031131页
作者: Lenka Zdeborová Florent Krząkała LPTMS UMR 8626 CNRS et Université Paris-Sud 91405 Orsay CEDEX France PCT UMR Gulliver 7083 CNRS-ESPCI 10 rue Vauquelin 75231 Paris France
We consider the problem of coloring the vertices of a large sparse random graph with a given number of colors so that no adjacent vertices have the same color. Using the cavity method, we present a detailed and system... 详细信息
来源: 评论
Genetic embedded matching approach to ground states in continuous-spin systems
收藏 引用
Physical Review E 2007年 第6期76卷 066706-066706页
作者: Martin Weigel []Department of Mathematics and the Maxwell Institute for Mathematical Sciences Heriot-Watt University Edinburgh EH14 4AS United Kingdom and Department of Physics and Astronomy University of Waterloo Waterloo Ontario Canada N2L 3G1
Due to an extremely rugged structure of the free energy landscape, the determination of spin-glass ground states is among the hardest known optimization problems, found to be NP hard in the most general case. Owing to... 详细信息
来源: 评论
Adaptation in stochastic tunneling global optimization of complex potential energy landscapes
收藏 引用
EUROPHYSICS LETTERS 2006年 第6期74卷 944-950页
作者: Hamacher, K. Univ Calif San Diego Ctr Theoret Biol Phys La Jolla CA 92093 USA
Global optimization remains one of the great challenges in scientific computing. One particular successful approach is the usage of tunneling functions to cross barriers and transition states more easily thus allowing... 详细信息
来源: 评论
Tractable fragments of Presburger Arithmetic
收藏 引用
THEORY OF COMPUTING SYSTEMS 2005年 第5期38卷 647-668页
作者: Subramani, K W Virginia Univ LDCSEE Morgantown WV 26506 USA
In this paper we introduce a problem called Quantified Integer Programming, which generalizes the Quantified Satisfiability problem (QSAT). In a Quantified Integer Program (QIP) the program variables can assume arbitr... 详细信息
来源: 评论
complexity and compilability of diagnosis and recovery of graph-based systems
收藏 引用
INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2005年 第10期20卷 1053-1076页
作者: Liberatore, P Univ Roma La Sapienza Dipartimento Informat & Sistemist Rome Italy
This article reports complexity results on diagnosis of systems modeled as graphs. In this model introduced by Rao and Viswanadham, each component is a node of a graph, and an edge indicates that faults propagate from... 详细信息
来源: 评论