信息与控制最新文献_第5页

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80039-0

引用次数: 0

A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems Gröbner基与Church-Rosser交换苏系统的超指数下界

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80035-3

Dung T. Huynh

引用次数: 54

Probabilistic analysis of a network resource allocation algorithm 网络资源分配算法的概率分析

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80028-6

Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas

{"title":"Probabilistic analysis of a network resource allocation algorithm","authors":"Nancy A. Lynch, Nancy D. Griffeth, Michael J. Fischer, Leonidas J. Guibas","doi":"10.1016/S0019-9958(86)80028-6","DOIUrl":"10.1016/S0019-9958(86)80028-6","url":null,"abstract":"<div>A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at greater distances. Choice of search direction is made non-deterministically. Analysis of expected response time is simplified by assuming that the search direction is chosen probabilistically, that messages require constant time, that the network is a tree with all leaves at the same distance from the root, and that requests and resources occur only at leaves. It is shown that the response time is approximated by the number of messages of one type that are sent during the execution of the algorithm, and that this number of messages is a nondecreasing function of the interarrival time for requests. Therefore, the worst case occurs when requests come in so far apart that they are processed sequentially. The expected time for the sequential case of the algorithm is analyzed by standard techniques. This time is shown to be bounded by a constant, independent of the size of the network. It follows that the expected response time for the algorithm is bounded in the same way.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"68 1","pages":"Pages 47-85"},"PeriodicalIF":0.0,"publicationDate":"1986-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(86)80028-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83753013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

An optimally data efficient isomorphism inference algorithm 一种数据效率最佳的同构推理算法

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80036-5

Peter A. Flangan

引用次数: 1

A logic for the description of non-deterministic programs and their properties 描述非确定性程序及其性质的一种逻辑

信息与控制 Pub Date : 1986-01-01 DOI: 10.1016/S0019-9958(86)80038-9

S. Graf, J. Sifakis

引用次数: 51

Simulation of Large Networks on Smaller Networks 大型网络在小型网络上的模拟

信息与控制 Pub Date : 1985-12-01 DOI: 10.1007/BFb0023994

H. Bodlaender, J. Leeuwen

引用次数: 36

Uniform characterizations of non-uniform complexity measures 非统一复杂性度量的统一表征

信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80026-7

José L. Balcázar, Josep Díaz, Joaquim Gabarró

引用次数: 16

The critical complexity of all (monotone) boolean functions and monotone graph properties 所有(单调)布尔函数的临界复杂度和单调图的性质

信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80036-X

Ingo Wegner

引用次数: 28

Author index for volume 67 第67卷作者索引

信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80037-1

引用次数: 0

A zero-one law for logic with a fixed-point operator 具有不动点算子的逻辑0 - 1定律

信息与控制 Pub Date : 1985-10-01 DOI: 10.1016/S0019-9958(85)80027-9

Andreas Blass, Yuri Gurevich, Dexter Kozen

{"title":"A zero-one law for logic with a fixed-point operator","authors":"Andreas Blass, Yuri Gurevich, Dexter Kozen","doi":"10.1016/S0019-9958(85)80027-9","DOIUrl":"10.1016/S0019-9958(85)80027-9","url":null,"abstract":"<div>The logic obtained by adding the least-fixed-point operator to first-order logic was proposed as a query language by Aho and Ullman (in “Proc. 6th ACM Sympos. on Principles of Programming Languages,” 1979, pp. 110–120) and has been studied, particularly in connection with finite models, by numerous authors. We extend to this logic, and to the logic containing the more powerful iterative-fixed-point operator, the zero-one law proved for first-order logic in (Glebskii, Kogan, Liogonki, and Talanov (1969), Kibernetika 2, 31–42; Fagin (1976), J. Symbolic Logic 41, 50–58). For any sentence φ of the extend logic, the proportion of models of φ among all structures with universe {1,2,…, n} approaches 0 or 1 as n tends to infinity. We also show that the problem of deciding, for any φ, whether this proportion approaches 1 is complete for exponential time, if we consider only φ's with a fixed finite vocabulary (or vocabularies of bounded arity) and complete for double-exponential time if φ is unrestricted. In addition, we establish some related results.</div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"67 1","pages":"Pages 70-90"},"PeriodicalIF":0.0,"publicationDate":"1985-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80027-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87954018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 81