Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Gerard Tel"'
Autor:
Johan Kwisthout, Gerard Tel
Publikováno v:
International Journal of Approximate Reasoning. 48(3):879-888
While quantitative probabilistic networks (QPNs) allow experts to state influences between nodes in the network as influence signs, rather than conditional probabilities, inference in these networks often leads to ambiguous results due to unresolved
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5eb877d58a33737b412752721378ba9e
Publikováno v:
Theory of Computing Systems. Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. Not only the solution of puzzles leads to interesting questions, but also
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::54b20cc57dbf1b394627a98c24f38bbc
https://doi.org/10.1007/s00224-008-9104-3
https://doi.org/10.1007/s00224-008-9104-3
Autor:
Hans L. Bodlaender, Gerard Tel
Publikováno v:
Journal of Graph Algorithms and Applications. 8:89-94
We connect two aspects of graph drawing, namely angular resolution, and the possibility to draw with all angles an integer multiple of 2π/d. A planar graph with angular resolution at least π/ 2c an be drawn with all angles an integer multiple of π
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ba980aff742e7890bea99d32070d0ae
https://doi.org/10.7155/jgaa.00083
https://doi.org/10.7155/jgaa.00083
Autor:
Gerard Tel
Publikováno v:
Introduction to Distributed Algorithms. :551-555
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63bc76c3ee057aa361dea8678e322c97
https://doi.org/10.1017/cbo9781139168724.019
https://doi.org/10.1017/cbo9781139168724.019
Autor:
Gerard Tel
Publikováno v:
Introduction to Distributed Algorithms. :556-571
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffffabbd0e5a6b739b4278f35bdf1c48
https://doi.org/10.1017/cbo9781139168724.020
https://doi.org/10.1017/cbo9781139168724.020
Autor:
Bernadette Charron-Bost, Gerard Tel
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 31:305-330
The Distributed Infinimum Approximation (or DIA, for short) problem is to compute or approximate a lower bound off a set of values distributed over different sites and channels of a distributed system. The values themselves change in time, but accord
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::113965b097883804a34dfa74cbdd3f18
https://doi.org/10.1051/ita/1997310403051
https://doi.org/10.1051/ita/1997310403051
Publikováno v:
Distributed Computing. 9:173-191
This article studies characteristic properties of synchronous and asynchronous message communications in distributed systems. Based on the causality relation between events in computations with asynchronous communications, we characterize computation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37ba5b46893663c91745cf761f0426a3
https://doi.org/10.1007/s004460050018
https://doi.org/10.1007/s004460050018
Autor:
Gerard Tel
Publikováno v:
Parallel Processing Letters. :357-366
This article proposes an election algorithm for the hypercube; it exchanges less than [Formula: see text] messages and uses O( log 2 N) time (where N is the size of the cube). A randomized version of the algorithm achieves the same (expected) asympto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::862e6e6d11ff7863e1acb1a7b5546ef9
https://doi.org/10.1142/s0129626495000333
https://doi.org/10.1142/s0129626495000333
Autor:
Gerard Tel, Michiel van Wezel
Publikováno v:
Information Processing Letters. 49:227-233
We give an assertional correctness proof for a version of Rana's termination detection algorithm. Safety is shown by means of reasoning with invariants, and liveness by means of a norm function, whose value decreases with every step of the detection
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01f92f6d5aa3cf8b450d66b7346f20ac
https://doi.org/10.1016/0020-0190(94)90059-0
https://doi.org/10.1016/0020-0190(94)90059-0
Autor:
GERARD TEL
Publikováno v:
International Journal of Foundations of Computer Science. :23-57
This paper analyses how the symmetry of a processor network influences the existence of a solution for the network orientation problem. The orientation of hypercubes and tori is the problem of assigning labels to each link of each processor, in such
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bef190086a3576376a9f4235c5bccdc7
https://doi.org/10.1142/s0129054194000037
https://doi.org/10.1142/s0129054194000037