咨询与建议

限定检索结果

文献类型

  • 108 篇 期刊文献
  • 40 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 129 篇 工学
    • 103 篇 计算机科学与技术...
    • 30 篇 电气工程
    • 22 篇 软件工程
    • 13 篇 信息与通信工程
    • 8 篇 控制科学与工程
    • 6 篇 电子科学与技术(可...
    • 3 篇 机械工程
    • 3 篇 动力工程及工程热...
    • 3 篇 化学工程与技术
    • 2 篇 力学(可授工学、理...
    • 2 篇 仪器科学与技术
    • 2 篇 材料科学与工程(可...
    • 2 篇 测绘科学与技术
    • 2 篇 石油与天然气工程
    • 2 篇 网络空间安全
    • 1 篇 土木工程
    • 1 篇 交通运输工程
    • 1 篇 环境科学与工程(可...
    • 1 篇 安全科学与工程
  • 57 篇 理学
    • 49 篇 数学
    • 4 篇 物理学
    • 3 篇 统计学(可授理学、...
    • 1 篇 地球物理学
    • 1 篇 生物学
  • 9 篇 管理学
    • 9 篇 管理科学与工程(可...
  • 5 篇 医学
    • 4 篇 临床医学
    • 1 篇 特种医学
  • 1 篇 经济学
    • 1 篇 应用经济学
  • 1 篇 法学
    • 1 篇 法学
  • 1 篇 文学
    • 1 篇 新闻传播学
  • 1 篇 艺术学

主题

  • 149 篇 deterministic al...
  • 12 篇 mobile agent
  • 9 篇 distributed algo...
  • 9 篇 rendezvous
  • 8 篇 optimization
  • 7 篇 randomized algor...
  • 7 篇 gathering
  • 6 篇 network
  • 6 篇 deterministic al...
  • 5 篇 matroid constrai...
  • 4 篇 graph
  • 4 篇 mobile robots
  • 4 篇 multiple access ...
  • 4 篇 global optimizat...
  • 4 篇 probabilistic al...
  • 4 篇 cost
  • 4 篇 dispersion
  • 3 篇 mobile agents
  • 3 篇 computational ge...
  • 3 篇 anonymous graphs

机构

  • 7 篇 univ quebec outa...
  • 4 篇 univ picardie ju...
  • 4 篇 univ liverpool d...
  • 4 篇 univ picardie ju...
  • 4 篇 univ quebec outa...
  • 3 篇 indian inst tech...
  • 3 篇 shandong normal ...
  • 3 篇 univ colorado de...
  • 2 篇 aix marseille un...
  • 2 篇 dhirubhai ambani...
  • 2 篇 beijing univ tec...
  • 2 篇 augusta univ sch...
  • 2 篇 indian inst tech...
  • 2 篇 univ liverpool d...
  • 2 篇 cnrs lif marseil...
  • 2 篇 univ picardie ju...
  • 2 篇 kyoto univ grad ...
  • 2 篇 univ new south w...
  • 2 篇 univ quebec dept...
  • 2 篇 indian inst tech...

作者

  • 16 篇 pelc andrzej
  • 14 篇 dieudonne yoann
  • 6 篇 mondal kaushik
  • 5 篇 kowalski dariusz...
  • 4 篇 bouchard sebasti...
  • 4 篇 chlebus bogdan s...
  • 3 篇 gorain barun
  • 3 篇 li min
  • 3 篇 suter david
  • 3 篇 anantharamu laks...
  • 3 篇 de marco gianluc...
  • 3 篇 miller avery
  • 3 篇 matousek j
  • 3 篇 kaur tanvir
  • 2 篇 ibaraki t
  • 2 篇 ivanyos gabor
  • 2 篇 guo longkun
  • 2 篇 xiao guobao
  • 2 篇 pandit supantha
  • 2 篇 rousseeuw peter ...

语言

  • 144 篇 英文
  • 3 篇 其他
  • 2 篇 中文
检索条件"主题词=deterministic algorithm"
149 条 记 录,以下是121-130 订阅
排序:
Pairwise Test Set Calculation using k-partite Graphs
Pairwise Test Set Calculation using k-partite Graphs
收藏 引用
International Conference on Software Maintenance
作者: Salecker, Elke Glesner, Sabine Berlin Inst Technol TU Berlin Berlin Germany
of input values and can be detected using pairwise test sets that cover each pair of input values. The generation of pairwise test sets with a minimal size is an NP-complete problem which implies that many algorithms ... 详细信息
来源: 评论
Fixed Outline Multi-Bend Bus Driven Floorplanning
Fixed Outline Multi-Bend Bus Driven Floorplanning
收藏 引用
11th International Symposium on Quality Electronic Design (ISQED)
作者: Sheng, Wenxu Dong, Sheqin Wu, Yuliang Goto, Satoshi Tsinghua Univ Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Chinese Univ Hong Kong Dept Comp Sci & Engn Shatin Hong Kong Peoples R China Waseda Univ Informat Prod & Syst Kitakyushu Fukuoka 8080135 Japan
Modern hierarchical SOC design flows need to deal with fixed-outline floorplanning under the interconnect constraints, in this paper, we address the problem of bus driven floorplanning in a fixed-outline area. Given a... 详细信息
来源: 评论
deterministic 7/8-approximation for the metric maximum TSP
收藏 引用
THEORETICAL COMPUTER SCIENCE 2009年 第47-49期410卷 5000-5009页
作者: Kowalik, Lukasz Mucha, Marcin Univ Warsaw Inst Informat PL-00913 Warsaw Poland
We present the first 7/8-approximation algorithm for the maximum Traveling Salesman Problem (MAX-TSP) with triangle inequality. Our algorithm is deterministic. This improves over both the randomized algorithm of Hassi... 详细信息
来源: 评论
On the Black-Box Complexity of Sperner's Lemma
收藏 引用
THEORY OF COMPUTING SYSTEMS 2009年 第3期45卷 629-646页
作者: Friedl, Katalin Ivanyos, Gabor Santha, Miklos Verhoeven, Yves F. Budapest Univ Technol & Econ H-1521 Budapest Hungary Hungarian Acad Sci Comp & Automat Res Inst H-1518 Budapest Hungary Univ Paris 11 CNRS LRI F-91405 Orsay France Natl Univ Singapore Ctr Quantum Technol Singapore 117543 Singapore Univ Paris 11 LRI F-91405 Orsay France ENST F-75013 Paris France
We present several results on the complexity of various forms of Sperner's Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimen... 详细信息
来源: 评论
algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain
收藏 引用
MATHEMATICAL NOTES 2009年 第1-2期85卷 68-81页
作者: Maevskii, A. E. So Fed Univ Rostov Na Donu Russia
A deterministic algorithm for calculating the roots of polynomials in one variable with coefficients in the ring of polynomials in several variables over an arbitrary integral domain is constructed. An estimate for th... 详细信息
来源: 评论
BIBD's for (13, 5, 5), (16, 6, 5) and (21, 6, 4) Possessing Possibly an Automorphism of Order 3
收藏 引用
World Academy of Science, Engineering and Technology 2009年 58卷 902-905页
作者: Martinjak, Ivica Pavčević, Mario-Osvin University of Zagreb Faculty of Electrical Engineering and Computing Department of Applied Mathematics Unska 3 HR - 10000 Zagreb Croatia
When trying to enumerate all BIBD's for given parameters, their natural solution space appears to be huge and grows extremely with the number of points of the design. Therefore, constructive enumerations are often... 详细信息
来源: 评论
Fractal fitting research on stock prices
Fractal fitting research on stock prices
收藏 引用
1st International Congress on Image and Signal Processing
作者: Lin, Yong Tong, Xin Renmin Univ China Informat Sch Dept Math Beijing 100872 Peoples R China
In this paper, we mainly study the law of stock price changes and the fitting method of it. After introducing the key point of fractal and Genetic algorithm, we focus on explaining the inverse problems of piecewise fr... 详细信息
来源: 评论
Optimal deterministic broadcasting in known topology radio networks
收藏 引用
DISTRIBUTED COMPUTING 2007年 第3期19卷 185-195页
作者: Kowalski, Dariusz R. Pelc, Andrzej Univ Liverpool Dept Comp Sci Liverpool L69 7ZF Merseyside England Univ Quebec Dept Informat Gatineau PQ J8X 3X7 Canada
We consider deterministic broadcasting in radio networks whose nodes have full topological information about the network. The aim is to design a polynomial algorithm, which, given a graph G with source s, produces a f... 详细信息
来源: 评论
Coupling stochastic and deterministic local search in examination timetabling
收藏 引用
OPERATIONS RESEARCH 2007年 第2期55卷 351-366页
作者: Caramia, Massimiliano Dell'Olmo, Paolo Univ Roma Tor Vergata Dipartimento Ingn Impresa I-00173 Rome Italy Univ Roma 1 Dipartimento Stat Probalitia & Stat Applicate I-00185 Rome Italy
In this paper, we propose a novel optimization algorithm for examination timetabling. It works by alternating two phases;one based on a stochastic local search and the other on a deterministic local search. The stocha... 详细信息
来源: 评论
deterministic M2M multicast in radio networks
收藏 引用
THEORETICAL COMPUTER SCIENCE 2006年 第1-3期362卷 196-206页
作者: Gasieniec, Leszek Kranakis, Evangelos Pelc, Andrzej Xin, Qin Univ Liverpool Dept Comp Sci Liverpool L69 7ZF Merseyside England Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Univ Quebec Dept Informat Gatineau PQ J8X 3X7 Canada Univ Bergen Dept Informat N-5020 Bergen Norway
We study the problem of exchanging messages within a fixed group of k nodes, called participants, in an n-node radio network, modeled as an undirected graph. This communication task was previously considered in the se... 详细信息
来源: 评论