A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Joining Local Knowledge to Communicate Reliably (Extended Abstract)
[article]
2017
arXiv
pre-print
Preserved Fulltext
We employ the General Adversary model of Hirt and Maurer and the recently introduced Partial Knowledge Model which subsume all known models for the adversary and local knowledge respectively. ...
Tight feasibility conditions, naturally involving the network topology, the adversary and the local knowledge of players, are presented. ...
In this work we obtain our results with respect to a General Byzantine adversary. The Partial Knowledge Model [6] . ...
arXiv:1711.01725v1
fatcat:gdwoxxjz65dhzfd2gxy46bexpy
Anonymous authentication with subset queries (extended abstract)
1999
Proceedings of the 6th ACM conference on Computer and communications security - CCS '99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
Anonymous authentication with subset queries, but without identity escrow, follows as an application of proofs of partial knowledge [15, 17, 16] . ...
We also extend our schemes to allow a prover to demonstrate membership in an arbitrary subset of users, anonymously and with identity escrow. ...
doi:10.1145/319709.319725
dblp:conf/ccs/BonehF99
fatcat:bq5rbacd2vb4zmh642v64ak4s4
Innovation and Global Issues 1: Extended Abstracts Book
[article]
2021
figshare.com
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
It is also stated that the Prophet went to the date grove location where Ibn Sayyad lives and tried to hear something from him by hiding himself with palm branches. ...
Rashid (d.152/769) The products have come to standardization and the idea of designing for the people of the world has formed with the globalization (Gölbaşı, 2010) . ...
The optimal portfolio provides a risk level with % 1.055 and an expected return with % 2.4. ...
doi:10.6084/m9.figshare.13634555.v1
fatcat:q5mkgjq3jrh5jn4ualb2pshj5u
Extended Particle Swarm Optimization by Partial Randomization for a Multi-Robot System
2010
The Abstracts of the international conference on advanced mechatronics : toward evolutionary fusion of IT and mechatronics : ICAM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this article we consider a version of the Particle Swarm Optimization (PSO) algorithm which is appropriate for search tasks of multi-agent systems consisting of small robots with limited sensing capability ...
Moreover, at each (information exchange) step the agents communicate with only a possibly different subset of the other agents leading to a dynamic neighborhood topology. ...
They considered the cases in which: (i) agents know their global positions and; (ii) agents rely on their local knowledge. ...
doi:10.1299/jsmeicam.2010.5.37
fatcat:5r6qrdunjjbnbdgpwbhdfi4k34
Accounting, Audit, Analysis: Transformation of Science and Business in New Economic Reality Book of Extended Abstracts
2021
Vilnius University Proceedings
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The book includes the abstracts of presentations of fourth international scientific conference "Accounting, Audit, Analysis: Transformation of Science and Business in New Economic Reality" dedicated to ...
Except the higher the respondents experience was, the larger part of the group identified the importance of knowledge of related with accounting fields, although the knowledge of languages was evaluated ...
Mediator analysis indicated 2 statistically significant partial mediation: 1) the relationship between evaluation of employee experience conditions and intention to leave the organization is partially ...
doi:10.15388/transformation-of-science-and-business.2021
fatcat:b3m6uoyl2rhjfc5t2tzlhgwcci
IDeixis
2004
Extended abstracts of the 2004 conference on Human factors and computing systems - CHI '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
These are among the simplest CBIR methods in the literature, and partial success with these methods would suggest even greater performance with more advanced techniques. ...
Each page is displayed as a thumbnail accompanied by a text abstract of its content. ...
doi:10.1145/985921.985933
dblp:conf/chi/YehTD04
fatcat:hppnrgdzrreqbl4cdxannniree
Reflective HCI
2004
Extended abstracts of the 2004 conference on Human factors and computing systems - CHI '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In extending this work to the responsive media environment of the TGarden, the relation is not limited to the rhythm of one body with another, but of one body with the salient responsive elements in the ...
ABSTRACT FIASCO is a location-based game that takes place on a website and on street corners. ...
It has continued with the support of Ken Anderson of Intel Research. We also thank Paul Berry, who built the FIASCO back-end. ...
doi:10.1145/985921.986203
dblp:conf/chi/DourishFSW04
fatcat:2riaoweryzhnza25n4hwbghwha
Page 7098 of Mathematical Reviews Vol. , Issue 97K
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Yau, An efficient algorithm for opti- mal linear broadcast routing with capacity constraints (extended abstract) (235-249); Ka Hing Lee, An improved scheme for the set intersection problem (250-263); Corrado ...
Priami, Interleav- ing based partial ordering semantics (264-278); Flavio Corradini, Compositionality for processes with durational actions (279- 294); Rosario Pugliese, A process calculus with asynchronous ...
Page 2906 of Mathematical Reviews Vol. , Issue 99d
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
broadcast with partial knowledge. ...
Summary: “This work is concerned with the problem of broad- casting a large message efficiently when each processor has partial prior knowledge about the contents of the broadcast message. ...
An Application Framework for Loosely Coupled Networked Cyber-Physical Systems
2010
2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This new paradigm is based on the partially ordered knowledge sharing model that makes explicit the abstract structure of a computation in space and time. ...
Based on this model, we propose an application framework that provides a uniform abstraction for a wide range of NCPS applications, especially those concerned with distributed sensing, optimization, and ...
Support from National Science Foundation Grant 0932397 (A Logical Framework for Self-Optimizing Networked Cyber-Physical Systems) and Office of Naval Research Grant N00014-10-1-0365 (Principles and Foundations ...
doi:10.1109/euc.2010.30
dblp:conf/euc/KimSKH10
fatcat:wr62kv2oibgtldvz3vpsnj25xy
Page 6274 of Mathematical Reviews Vol. , Issue 2003h
[page]
2003
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The question of characterizing networks which support optimal (i.e., shortest- path) interval routing has been thoroughly investigated for each of the variants and under different models, with only partial ...
abstract) (658-667). ...
Rapid software prototyping for heterogeneous and distributed platforms
2019
Advances in Engineering Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This enables rapid prototyping, retargeting and reuse of existing software, while allowing for hardware specific optimization if required. ...
With the continued stagnation of single-threaded performance, using hardware accelerators such as GPUs or FPGAs is necessary. ...
compiler infrastructure and their own implementation of array abstractions, they fail to compose with the larger Python ecosystem and are hard to extend. ...
doi:10.1016/j.advengsoft.2019.02.002
fatcat:k4k7oaexsnfaxdb76kcl53wf5e
Page 4177 of Mathematical Reviews Vol. , Issue 2001F
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
of knowledge for all NP relations (extended abstract) (451-462); William Aiello, Sandeep Bhatt, Rafail Ostro- vsky and S. ...
Ramesh, Hardness of set cover with intersection 1 (624-635); Michael Elkin and David Peleg, Strong inapproximability of the basic k-spannet problem (extended abstract) (636-647); Dietrich Kuske, Infinite ...
Page 10245 of Mathematical Reviews Vol. , Issue 2004m
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In this paper, we present a linear algorithm to determine the optimal k-broadcast scheme in an arbitrary tree. ...
Hence the main problem in fast execution of the above tasks is breaking symmetry with restricted knowledge of the ring. ...
A Mechanized Model for CAN Protocols
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper focuses on broadcast algorithms for Content Addressable Network (CAN). ...
Since these algorithms run on top of complex P2P systems, finding the right level of abstraction in order to prove their functional correctness is difficult. ...
Second, we show that, provided the history is optimal, we can treat one more message and provide an extended znlmap that is still optimal for the new history. ...
doi:10.1007/978-3-642-37057-1_20
fatcat:ekrgacwrqrgc5dhtoe7hk6moj4
« Previous
Showing results 1 — 15 out of 19,551 results