A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Probabilistic Model Checking: One Step Forward in Wireless Sensor Networks Simulation
2015
International Journal of Distributed Sensor Networks
Preserved Fulltext
A novel collision resolution algorithm for wireless sensor networks is formally analysed via probabilistic model checking. ...
Discrete time Markov chains (DTMCs) have been proposed as modelling formalism and the well-known probabilistic symbolic model checker PRISM is used to check some correctness properties and different operating ...
Probabilistic Model Checking. Probabilistic model check- ing is a formal verification technique for the automatic analysis of systems that exhibit stochastic behaviour. ...
doi:10.1155/2015/285396
fatcat:wjlmile7unelpdnob7cum3cqdm
Anonymous On-Demand Routing and Secure Checking of Traffic Forwarding for Mobile Ad Hoc Networks
2012
2012 IEEE 31st Symposium on Reliable Distributed Systems
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.
The ARSC consists of anonymous routing, which is based on identity-based encryption pseudonym and single-round onion, and secure checking of traffic forwarding in data transmission phase, to achieve strong ...
Data Forwarding Phase In our protocol, the final hash chain value generated by the source is distributed to each participating nodes during the RREQ phase. ...
The ARSC includes anonymous routing, which is based on identity-based encryption pseudonym and single-round onion routing, and secure checking of traffic forwarding based on hash chain. ...
doi:10.1109/srds.2012.6
dblp:conf/srds/JiangX12
fatcat:o6mwkgqvu5cxtjhd47q4zhb5fu
Distributed Forward Checking May Lie for Privacy
[chapter]
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.
In previous work, we proposed Distributed Forward Checking (DisFC) [2] . ...
C 1
Assignment Privacy on DisFC To achieve assignment privacy, we proposed [2] the Distributed Forward Checking (DisFC) algorithm as follows. ...
doi:10.1007/978-3-540-73817-6_6
dblp:conf/csclp/BritoM06
fatcat:xbcr6qsolfcxtov6c264hdvaiq
Asynchronous Inter-Level Forward-Checking for DisCSPs
[chapter]
2009
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.
The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). ...
The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. ...
This algorithm is based on the forward checking (FC) algorithm for CSPs, but performs forward checking asynchronously. In this paper, we present two new asynchronous algorithms for solving DisCSPs. ...
doi:10.1007/978-3-642-04244-7_25
fatcat:yroue2onvvgifle7ozfsvammpm
Store Buffer Design in First-Level Multibanked Data Caches
2005
SIGARCH Computer Architecture News
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.
For that we propose a particular two-level STB design in which forwarding is done speculatively from a distributed first-level STB made of extremely small banks, while a centralized, second-level STB enforces ...
Moreover, the two-level STB admits two enhancements that simplify the design leaving performance almost unchanged: i) removing the data forwarding capability from the secondlevel STB, and ii) not checking ...
STB1 data forwarding without age checking Until now, we have used a STB1 where instruction ages are explicitly checked to speculatively forward data. ...
doi:10.1145/1080695.1070009
fatcat:yoaqnvhqqvef3bmt2uviize4yy
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks
2005
Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05)
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 the algorithm, an efficient strategy is used to determine the forward status of a node by just checking whether there exists a ring that contains all its neighbors. ...
In this paper, we propose a distributed broadcasting algorithm for wireless ad hoc networks. ...
In the previous distributed selfpruning algorithms, for each node v, all pairs of neighbors of v are checked in order to determine its status. ...
doi:10.1109/pdcat.2005.75
dblp:conf/pdcat/LiPC05
fatcat:pmf4juxrtvaahg4iyg7o6itmfy
Page 62 of None Vol. 9, Issue 1
[page]
1926
None
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
TOOPS
the check and slide it forward along the wire. A completed distribution is shown in the forward side of the picture. ...
The top one of the three figures of the check indicates the number of the check; that is, 23 indicates that there are 23 checks in this column in the distribution, thus saving us the necessity of counting ...
Asynchronous Forward-checking for DisCSPs
2007
Constraints
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.
The asynchronous forward-checking algorithm (AFC) is a distributed search algorithm that keeps one consistent partial assignment at all times. ...
A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. ...
The present paper proposes a new distributed search algorithm on DisCSPs, Asynchronous Forward-Checking (AFC). ...
doi:10.1007/s10601-006-9013-5
fatcat:oe6uw7dpkbfyroipsl6dhoneea
Petri net model and performance evaluation of an autonomous decentralized network system
1999
Computers and Mathematics with Applications
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.
Waiting to start the check whether the normal (forward) direction network is reset. ...
fails. t8 Start checking if the normal (forward) direction network was reset. t7 The reset check of the normal (forward) direction network was successful and data alternation is canceled. ts The reset ...
doi:10.1016/s0898-1221(99)00295-3
fatcat:w2yxf6qtevaahbu7t27vesjwjy
Enhancing the QoS in Hybrid Wireless Networks
2016
International Journal of Science and Research (IJSR)
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 2022; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a distributed Quality of Service (QoS) oriented routing algorithm for hybrid wireless network. ...
Here the QoS-Oriented Distributed routing protocol (QOD) is proposed to enhance the QoS support of hybrid wireless networks. ...
Traffic redundancy elimination algorithm Here before forwarding the packets, the nodes checks that whether this packet is already send in network or not. ...
doi:10.21275/v5i2.18021604
fatcat:47nvnp2ysreutlmpljn3qidium
An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks
2006
2006 IEEE International Conference on Mobile Ad Hoc and Sensor Sysetems
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 paper, we propose an efficient, distributed and localized algorithm for finding an almost connected dominating set of small size on wireless ad hoc networks. ...
For deciding forwarding or non-forwarding status for a node v, our algorithm does not check all pairs of v's neighbors. ...
The existing algorithms for deciding forwarding or non-forwarding status for a node v need to check every pair of neighboring nodes of v. ...
doi:10.1109/mobhoc.2006.278557
dblp:conf/mass/LiPC06
fatcat:xfreqey4urc4povqb7n2zgzbru
An efficient peer-to-peer indexing tree structure for multidimensional data
2009
Future generations computer systems
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 2010; you can also visit the original URL.
The file type is application/pdf.
Furthermore, SDI overcomes the root-bottleneck problem existing in most other tree-based distributed indexing techniques. ...
As one of the most important technology for implementing large-scale distributed systems, peer-to-peer (P2P) computing has attracted much attention in both research and academia communities, for its advantages ...
If anc can not cover r, the query is forwarded to anc's parent maintainer to check a bigger region. ...
doi:10.1016/j.future.2008.02.010
fatcat:ju7r3gyjhbfhpbmztyccixnjdm
Verification of MPI Java programs using software model checking
2016
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '16
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.
MPI (message passing interface) is a popular standard for writing message oriented distributed applications. ...
We evaluated our approach using small examples where model checking revealed message orders that would result in incorrect system behavior. ...
JPF has limitation that it cannot model check programs executing on different machines. ...
doi:10.1145/2851141.2851192
dblp:conf/ppopp/RehmanAS16
fatcat:35nko5a2premdkism6viby32b4
Joint compute and forward for the two way relay channel with spatially coupled LDPC codes
2012
2012 IEEE Global Communications Conference (GLOBECOM)
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2012 pre-print arXiv:1205.5904v1 fatcat:xzi6hdvrajalngcamte75syvmm
The best known achievable rates for this problem can be achieved through either decode and forward or compute and forward relaying. ...
We are particularly interested in reliable physical layer network coding in which the relay performs perfect error correction prior to forwarding messages. ...
The check nodes process these messages and forward their estimates back to the variable nodes. This process continues until the iterations reach a fixed point. ...
doi:10.1109/glocom.2012.6503465
dblp:conf/globecom/HernN12
fatcat:vd6dodusgjfg7h7h2zy7jbhcry
Page 31 of Journal of Accountancy Vol. 37, Issue 1
[page]
1924
Journal of Accountancy
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The distribution of the payroll will be forwarded to the head office immediately after the close of the month’s business and will be used for the purpose of completing cost data and entries on the general ...
If payment is made by check as is usual in the majority of industrial plants, the head office will check the payroll against the canceled checks. ...
« Previous
Showing results 1 — 15 out of 866,399 results