A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
Filters
Empirical Evaluation of Mutual Exclusion Algorithms for Distributed Systems
2000
Journal of Parallel and Distributed Computing
Preserved Fulltext
We have evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSCÂ860 system, with their empirical results compared in terms of such criteria as the number of ...
Mutual exclusion in distributed memory systems is realized by passing messages among sites to establish a sequence for the waiting sites to enter the critical section. ...
Department of Energy, Mathematical, Information and Computational Sciences Division (ER-31). We also thank Zhiyuan Li for his suggestion of the modified Raymond algorithm. ...
doi:10.1006/jpdc.2000.1635
fatcat:cedniahmengydghy4e7d6twkcy
Parallel performance results for the OpenMOC neutron transport code on multicore platforms
2016
The international journal of high performance computing 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 2018; you can also visit the original URL.
The file type is application/pdf.
This paper describes the parallel transport sweep algorithm in the OpenMOC method of characteristics (MOC) neutron transport code for multi-core platforms using OpenMP. ...
The shift towards multi-core architectures has ushered in a new era of shared memory parallelism for scientific applications. ...
number of mutual exclusion collisions was empirically measured. ...
doi:10.1177/1094342016630388
fatcat:ql5wp6m2cjfaxfgxhtn5qfetoi
Efficiently enforcing mutual state exclusion requirements in symbolic supervisor synthesis
2021
2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)
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.
If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User ...
purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication ...
ACKNOWLEDGMENT The authors thank Bart Wetzels for his initial efforts on the topic. ...
doi:10.1109/case49439.2021.9551593
fatcat:isci5bb3rzdajislscnn5zs6ca
Page 5690 of Mathematical Reviews Vol. , Issue 99h
[page]
1999
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.
Finally, we empirically evaluate the performance of our sorting strategies by applying them to shearsort, a common two-dimensional mesh sorting algorithm. ...
The subject of this paper is the performance gap between deter- ministic and randomized algorithms for mutual exclusion, as mea- sured by the number of bits required for the shared variable. ...
QoS-Enabled Distributed Mutual Exclusion in Public Clouds
[chapter]
2011
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 2012; you can also visit the original URL.
The file type is application/pdf.
This paper presents a distributed mutual exclusion algorithm called Prioritizable Adaptive Distributed Mutual Exclusion (PADME) that we designed to meet the need for differentiated services between applications ...
Popular public cloud infrastructures tend to feature centralized, mutual exclusion models for distributed resources, such as file systems. ...
Distributed Mutual Exclusion in Public Clouds This section presents an algorithm called Prioritizable Adaptive Distributed Mutual Exclusion (PADME) that we developed to meet the cloud file system challenges ...
doi:10.1007/978-3-642-25106-1_9
fatcat:wboetq2ytjgv5oxxgtotyu73ve
Coupled Bayesian Sets Algorithm for Semi-supervised Learning and Information Extraction
[chapter]
2012
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 2019; you can also visit the original URL.
The file type is application/pdf.
We believe that this problem can be overcome by simultaneously learning independent classifiers in a new approach named Coupled Bayesian Sets algorithm, based on Bayesian Sets, for many different categories ...
Experimental results show that simultaneously learning a coupled collection of classifiers for random 11 categories resulted in much more accurate extractions than training classifiers through original ...
Heller for making available their Bayesian set code for comparison. In addition, we would like to thank Tom Mitchell and all the Read The Web group for helping on issues related to NELL. ...
doi:10.1007/978-3-642-33486-3_20
fatcat:x5dtslczzvfcngo466nktdpgc4
A Scene Image is Nonmutually Exclusive—A Fuzzy Qualitative Scene Understanding
2014
IEEE transactions on fuzzy 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.
Other Versions
Evaluations in term of qualitative and quantitative using large numbers and challenging public scene datasets have shown the effectiveness of our proposed method in modeling the non-mutually exclusive ...
In this paper, we show that scene images are non-mutually exclusive, and propose the Fuzzy Qualitative Rank Classifier (FQRC) to tackle the aforementioned problems. ...
The first term is the error bound because of the mutually exclusive data and the second term is due to the non-mutually exclusive data. ...
doi:10.1109/tfuzz.2014.2298233
fatcat:pqz2cayiubcstoemerlmagqh7e
Experiences on Grid Shared Data Programming
2008
2008 International Conference on Complex, Intelligent and Software Intensive 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.
There is little support for other paradigms such as shared data or associative programming. ...
We start by assessing the landscape of grid programming solutions with a focus on shared data concepts. ...
The same is true for the mutual exclusion algorithms which have been evaluated through experiments on fast interconnected machines (Sopena et al., 2007) . ...
doi:10.1109/cisis.2008.118
dblp:conf/cisis/TudorC08
fatcat:bytnje2tqfa3lapgvba5yzgbdi
Meta-Learning without Memorization
[article]
2020
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
However, most meta-learning algorithms implicitly require that the meta-training tasks be mutually-exclusive, such that no single model can solve all of the tasks at once. ...
By doing so, our algorithm can successfully use data from non-mutually-exclusive tasks to efficiently adapt to novel tasks. ...
Alemi, Kevin Murphy, Luke Metz, Abhishek Kumar and the anonymous reviewers for helpful discussions and feedback. M. Yin and M. Zhou acknowledge the support of the U.S. ...
arXiv:1912.03820v3
fatcat:dsunnq42zvdsxa372bdtkn56yi
Decomposition methodology for classification tasks: a meta decomposer framework
2006
Pattern Analysis and 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 2016; you can also visit the original URL.
The file type is application/pdf.
The idea of decomposition methodology for classification tasks is to break down a complex classification task into several simpler and more manageable sub-tasks that are solvable by using existing induction ...
The experimental study validates the effectiveness of the proposed meta-decomposer on a set of benchmark datasets. ...
This framework nests many algorithms, two of which are tested empirically over a set of benchmark datasets. ...
doi:10.1007/s10044-006-0041-y
fatcat:spa6kd3jd5dktjy563f5cpsomy
ProApproX
2011
Proceedings of the 2011 international conference on Management of data - SIGMOD '11
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.
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. ...
A user chooses between a variety of query answering techniques, both exact and approximate, and observes the running behavior, pros, and cons, of each method, in terms of efficiency, precision of the result ...
We have the possibility of taking as input a p-document in the local dependency model, with ind -standing for independent choice of each child -and mux nodes -standing for mutually exclusive choice of ...
doi:10.1145/1989323.1989480
dblp:conf/sigmod/SenellartS11
fatcat:okoyaxoh6nak3ai3ykn3ybbwta
Information theoretic approaches for inference of biological networks from continuous-valued data
2016
BMC Systems Biology
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.
Our approach overcomes both of these limitations, as demonstrated by a substantial improvement in empirical performance for a set of 160 GRNs of varying size and topology. ...
However, despite the theoretical and empirical advantages of these new measures, they do not circumvent the fundamental limitation of indeterminacy exhibited across this class of biological networks. ...
Both of these algorithms correct for bias and have been empirically demonstrated as robust to the selection of K [33] . ...
doi:10.1186/s12918-016-0331-y
pmid:27599566
pmcid:PMC5013667
fatcat:tiqjrscyrndj7od6x3iztovmmi
Quantifying the morphosyntactic content of Brown Clusters
2019
Proceedings of the 2019 Conference of the North
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.
We show that increases in Average Mutual Information, the clustering algorithms' optimization goal, are highly correlated with improvements in encoding of morphosyntactic information. ...
Our results provide empirical evidence that downstream NLP systems addressing tasks dependent on morphosyntactic information can benefit from word cluster features. ...
Both are greedy algorithms that optimize for high Average Mutual Information (AMI). ...
doi:10.18653/v1/n19-1157
dblp:conf/naacl/CiosiciDA19
fatcat:jvjjvtu7ejdddcwsl4w4f24rou
Weighted Mutual Exclusion Bootstrapping for Domain Independent Lexicon and Template Acquisition
2008
Australasian Language Technology Association Workshop
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.
We present the Weighted Mutual Exclusion Bootstrapping (WMEB) algorithm for simultaneously extracting precise semantic lexicons and templates for multiple categories. ...
while still enforcing mutual exclusion between the categories. ...
Acknowledgements We would like to thank the anonymous reviewers and members of the LTRG at the University of Sydney, for their feedback. ...
dblp:conf/acl-alta/McIntoshC08
fatcat:wnavwulqbbejdld7dmbudvfhoq
Determinants of Efficiency and Productivity in German Property-Liability Insurance: Evidence for 1995–2006
2009
Geneva papers on risk and insurance. Issues and practice
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 2018; you can also visit the original URL.
The file type is application/pdf.
A major contribution of the paper is its analysis of six efficiency determinants -firm size, distribution channels, ownership forms, product specialisation, financial leverage and premium growth -using ...
Using data envelopment analysis (DEA) and covering the period 1995-2006, we find that there is potential for the market to improve by about 20 percentage points in terms of technical efficiency and about ...
They find economic evidence for the absence of performance advantages of insurers with specialised distribution systems. ...
doi:10.1057/gpp.2009.10
fatcat:wlwa2stg6jebxbif3nmveihbz4
« Previous
Showing results 1 — 15 out of 49,130 results