Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,059,003 papers from all fields of science
Search
Sign In
Create Free Account
DISC
Known as:
WDAG
, Workshop on Distributed Algorithms on Graphs
The International Symposium on Distributed Computing (DISC) is an annual academic conference for refereed presentations, whose focus is the theory…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Dijkstra Prize
Distributed computing
European Association for Theoretical Computer Science
Lecture Notes in Computer Science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Web service discovery using combined bi-term topic model and WDAG similarity
A. Baskara
,
R. Sarno
11th International Conference on Information…
2017
Corpus ID: 20925540
In recent years, many web services had been published by service providers. Finding similar web services to replace existing web…
Expand
2016
2016
Sugarcane variety identification using Dynamic Weighted Directed Acyclic Graph Similarity
A. H. Utomo
,
R. Sarno
,
R. V. Ginardi
International Conference on Information…
2016
Corpus ID: 25265656
Dynamic wDAG Similarity algorithm can be applied to sugarcane annotation. At first, we have to make a wDAG structure of many…
Expand
2015
2015
Model-Based Automotive Partitioning and Mapping for Embedded Multicore Systems
Robert H¨ottger
,
Lukas Krawczyk
,
B. Igel
2015
Corpus ID: 8001179
This paper introduces novel approaches to partitioning and mapping in terms of model-based embedded multicore system engineering…
Expand
Review
2007
Review
2007
A Survey of General and Architecture-speciic Compiler Optimization Techniques 1 Architecture-independent Optimizations 1.1 Optimal Register Allocation
M. Hsiao
,
B. Whitlock
2007
Corpus ID: 15128245
Experience with commercial and research high-performance architectures has indicated that the compiler plays an increasingly…
Expand
2004
2004
Adaptive Stabilization of Reactive Protocols
S. Kutten
,
B. Patt-Shamir
Foundations of Software Technology and…
2004
Corpus ID: 10675327
A self-stabilizing distributed protocol can recover from any state-corrupting fault. A self-stabilizing protocol is called…
Expand
2003
2003
Applying Byzantine Agreement Protocols to the Intrusion Detection Problem in Distributed Systems
F. C. Osorio
,
Xiaoning Wang
2003
Corpus ID: 4540938
"Fixed fortifications are monuments to the stupidity of man" General George Patton, Jr. Solutions to the Byzantine General…
Expand
2000
2000
Improving the E ectiveness of Web
CachingJean-Marc Menaud
2000
Corpus ID: 9156041
The bandwidth demands on the (WorldWide) Web continue to grow at an exponential rate. It is thus becoming crucial to provide…
Expand
1997
1997
Distributed algorithms : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997 : proceedings
M. Mavronicolas
,
P. Tsigas
1997
Corpus ID: 53732256
Towards fault-tolerant and secure agentry.- Workflow management - An exercise in distributed computing.- In memory of Anya…
Expand
1994
1994
Distributed Algorithms, 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29 - October 1, 1994, Proceedings
Gerard Tel
,
P. Vitányi
1994
Corpus ID: 267811881
1993
1993
Distributed Algorithms: 7th International Workshop, Wdag '93, Lausanne, Switzerland, September 27-29, 1993 : Proceedings
A. Schiper
1993
Corpus ID: 60780618
Efficient wait-free implementation of a concurrent priority queue.- Binary snapshots.- Linear-time snapshot protocols for…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE