发布求助
文献互助 智能选刊 最新文献

[1993] The 2nd Israel Symposium on Theory and Computing Systems最新文献

筛选
英文 中文
Competitive algorithms for the weighted server problem 加权服务器问题的竞争算法
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253459
A. Fiat, Moty Ricklin
{"title":"Competitive algorithms for the weighted server problem","authors":"A. Fiat, Moty Ricklin","doi":"10.1109/ISTCS.1993.253459","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253459","url":null,"abstract":"The authors deal with a generalization of the k-server problem, in which the servers are unequal. In the weighted server model each of the servers is assigned a positive weight. The cost associated with moving a server equals the product of the distance traversed and the server weight. A weighted k-server algorithm is called competitive if the competitive ratio depends only upon the number of servers. (i.e., the competitive ratio is independent of the weights associated with the servers and the number of points in the metric space). For the uniform metric space, they give super exponential competitive algorithms for any set of weights. If the servers have one of two possible weights, they give deterministic exponential competitive algorithms and randomized polynomial competitive algorithms. They use the MIN operator for both algorithms. One can model the problem of storage management for RAM and E/sup 2/PROM type memories as a weighted server problem with two weights on the uniform metric space.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123421993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 51
Optimal speedup of Las Vegas algorithms 拉斯维加斯算法的最佳加速
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253477
M. Luby, A. Sinclair, David Zuckerman
{"title":"Optimal speedup of Las Vegas algorithms","authors":"M. Luby, A. Sinclair, David Zuckerman","doi":"10.1109/ISTCS.1993.253477","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253477","url":null,"abstract":"Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when its stops but whose running time is a random variable. The authors consider the problem of minimizing the expected time required to obtain an answer from A using strategies which simulate A as follows: run A for a fixed amount of time t/sub 1/, then run A independent for a fixed amount of time t/sub 2/, etc. The simulation stops if A completes its execution during any of the runs. Let S=(t/sub 1/, t/sub 2/,. . .) be a strategy, and let l/sub A/=inf/sub S/T(A,S), where T(A,S) is the expected value of the running time of the simulation of A under strategy S. The authors describe a simple universal strategy S/sup univ/, with the property that, for any algorithm A, T(A,S/sup univ/)=O(l/sub A/log(l/sub A/)). Furthermore, they show that this is the best performance that can be achieved, up to a constant factor, by any universal strategy.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114774852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 566
A well-characterized approximation problem 一个很好表征的近似问题
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253463
J. Håstad, S. Phillips, S. Safra
{"title":"A well-characterized approximation problem","authors":"J. Håstad, S. Phillips, S. Safra","doi":"10.1109/ISTCS.1993.253463","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253463","url":null,"abstract":"The authors consider the following NP optimization problem: given a set of polynomials P/sub i/(x), i=1. . .s of degree at most 2 over GF(p) in n variables, find a root common to as many as possible of the polynomials P/sub i/(x). They prove that in the case when the polynomials do not contain any squares as monomials, it is always possible to approximate this problem within a factor of /sup p2///sub p-1/ in polynomial time. This follows from the stronger statement that one can, in polynomial time, find an assignment that satisfies at least /sup p-1///sub p2/ of the nontrivial equations. More interestingly, they prove that approximating the maximal number of polynomials with a common root to within a factor of p- in is NP-hard. They also prove that for any constant delta <1, it is NP-hard to approximate the solution of quadratic equations over the rational numbers, or over the reals, within n/sup delta /.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115684244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
Efficient on-line call control algorithms 高效的在线呼叫控制算法
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253460
J. Garay, I. Gopal, S. Kutten, Y. Mansour, M. Yung
{"title":"Efficient on-line call control algorithms","authors":"J. Garay, I. Gopal, S. Kutten, Y. Mansour, M. Yung","doi":"10.1109/ISTCS.1993.253460","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253460","url":null,"abstract":"The authors study the problem of on-line call control, i.e., the problem of accepting or rejecting an incoming call without knowledge of future calls. The problem is part of the more general problem of bandwidth allocation and management. Intuition suggests that knowledge of future call arrivals can be crucial to the performance of the system. They present on-line call control algorithms that, in some circumstances, are competitive, i.e., perform (up to a constant factor) as well as their off-line, clairvoyant counterparts. They also prove the optimality of some algorithms. The model is that of a line of nodes, and they investigate a variety of cases concerning the value of the calls. The value is gained only if the call terminates successfully, otherwise-if the call is rejected, or prematurely terminated-no value is gained. The performance of the algorithm is then measured by the cumulative value achieved, when given a sequence of calls. The variety of call value criteria captures the most natural cost assignments to network services.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122185470","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 88
Zero-one permanent is not=P-complete, a simpler proof 0 - 1永久不= p完全，一个更简单的证明
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253457
A. Ben-Dor, S. Halevi
{"title":"Zero-one permanent is not=P-complete, a simpler proof","authors":"A. Ben-Dor, S. Halevi","doi":"10.1109/ISTCS.1993.253457","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253457","url":null,"abstract":"Valiant (1979) proved that computing the permanent of a 01-matrix is not=P-complete. The authors present another proof for the same result. The proof uses 'black box' methodology, which facilitates its presentation. They also prove that deciding whether the permanent is divisible by a small prime is not=P-hard. They conclude by proving that a polynomially bounded function can not be not=P-complete under 'reasonable' complexity assumptions.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132893924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
The Las-Vegas processor identity problem (how and when to be unique) 拉斯维加斯处理器标识问题(如何以及何时是唯一的)
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253474
S. Kutten, R. Ostrovsky, B. Patt-Shamir
{"title":"The Las-Vegas processor identity problem (how and when to be unique)","authors":"S. Kutten, R. Ostrovsky, B. Patt-Shamir","doi":"10.1109/ISTCS.1993.253474","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253474","url":null,"abstract":"One of the fundamental problems in distributed computing is how identical processes with identical local memory can choose unique IDs provided they can flip a coin. The variant considered is the asynchronous shared memory model (atomic registers), and the basic correctness requirement is that upon termination the processes must always have unique IDs. The authors study this problem from several viewpoints. On the positive side, they present the first Las-Vegas protocol that solves the problem. The protocol terminates in (optimal) O(log n) expected time, using O(n) shared memory space, where n is the number of participating processes. On the negative side, they show that there is no Las-Vegas protocol unless n is known precisely, and that no finite-state Las-Vegas protocol can work under schedules that may depend on the history of the shared variable. For the case of arbitrary adversary, they present a Las-Vegas protocol that uses O(n) unbounded registers.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116545718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 23
On fixed-parameter tractability and approximability of NP-hard optimization problems NP-hard优化问题的定参数可跟踪性和近似性
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253478
L. Cai, Jianer Chen
{"title":"On fixed-parameter tractability and approximability of NP-hard optimization problems","authors":"L. Cai, Jianer Chen","doi":"10.1109/ISTCS.1993.253478","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253478","url":null,"abstract":"Fixed-parameter tractability and approximability of NP-hard optimization problems are studied based on a model GC(s(n), Pi /sub k//sup L/). The main results are (1) a class of NP-hard optimization problems, including dominating-set and zero-one integer-programing, are fixed-parameter tractable if and only if GC(s(n), Pi /sub 2//sup L/) contained in P for some s(n) in omega (log n); (2) most approximable NP-hard optimization problems are fixed-parameter tractable. In particular, the class MAX NP is fixed-parameter tractable; (3) a class of optimization problems do not have fully polynomial time approximation scheme unless GC(s(n), Pi /sub k//sup L/) contained in P for some s(n) in omega (log n) and for some k>l; and (4) every fixed-parameter tractable optimization problem can be approximated in polynomial time to a non-trivial ratio.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125245932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 116
Hot-potato worm routing is almost as easy as store-and-forward packet routing 热土豆蠕虫路由几乎和存储转发数据包路由一样简单
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253469
I. Newman, A. Schuster
{"title":"Hot-potato worm routing is almost as easy as store-and-forward packet routing","authors":"I. Newman, A. Schuster","doi":"10.1109/ISTCS.1993.253469","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253469","url":null,"abstract":"The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-potato style is a desired form of communication in high-speed optical interconnection networks. The authors develop a simple method for the design of parallel hot-potato worm routing algorithms. The basic approach is to simulate known packet routing algorithms, so that in each step worms are moved around instead of packets. For hot-potato permutation routing of worms of size k the authors have the following results. They get a O(k/sup 2.5/n) algorithm for the n*n mesh, and a O(k/sup 1.5/n) algorithm for the corresponding offline problem. For the 2/sup n/-nodes hypercube they get a O(k/sup 3/n log /sup 2/n) deterministic algorithm, and a O(k/sup 3/n) randomized algorithm. Although the results are given for permutation routing on the mesh and the hypercube, the general method can be applied to many other networks and to more general communication patterns as well. Moreover, once better routing algorithms are found for the underlying network, the worm routing algorithm improves, too.<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122919250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Approximating bounded 0-1 integer linear programs 近似有界0-1整数线性规划
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253482
D. Peleg, G. Schechtman, A. Wool
{"title":"Approximating bounded 0-1 integer linear programs","authors":"D. Peleg, G. Schechtman, A. Wool","doi":"10.1109/ISTCS.1993.253482","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253482","url":null,"abstract":"The problem of finding approximate solutions for a subclass of 0-1 integer linear programming denoted by I L P(k,p) is considered. The problem involves finding X in","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"95 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114264198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 29
Deterministic approximate counting of depth-2 circuits 深度2电路的确定性近似计数
[1993] The 2nd Israel Symposium on Theory and Computing Systems Pub Date : 1993-06-07 DOI: 10.1109/ISTCS.1993.253488
M. Luby, B. Velickovic, A. Wigderson
{"title":"Deterministic approximate counting of depth-2 circuits","authors":"M. Luby, B. Velickovic, A. Wigderson","doi":"10.1109/ISTCS.1993.253488","DOIUrl":"https://doi.org/10.1109/ISTCS.1993.253488","url":null,"abstract":"The authors describe deterministic algorithms which for a given depth-2 circuit F approximate the probability that on a random input F outputs a specific value alpha . The approach gives an algorithm which for a given GF(2) multivariate polynomial p and given in >0 approximates the number of zeros (or ones) of p within a multiplicative factor 1+ in . The algorithm runs in time exp(exp(O( square root log(n/ in )))), where n is the size of the circuit. They also obtain an algorithm which given a DNF formula F and in >0 approximates the number of satisfying assignments of F within a factor of 1+ in and runs in time exp(O((log(n/ in ))/sup 4/)).<<ETX>>","PeriodicalId":281109,"journal":{"name":"[1993] The 2nd Israel Symposium on Theory and Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130956049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 79
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信