Search results for "D algorithm"
showing 10 items of 327 documents
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes
2005
The static frequency assignment problem on cellular networks can be abstracted as a multicoloring problem on a weighted graph, where each vertex of the graph is a base station in the network, and the weight associated with each vertex represents the number of calls to be served at the vertex. The edges of the graph model interference constraints for frequencies assigned to neighboring stations. In this paper, we first propose an algorithm to multicolor any weighted planar graph with at most $\frac{11}{4}W$ colors, where W denotes the weighted clique number. Next, we present a polynomial time approximation algorithm which garantees at most 2W colors for multicoloring a power square mesh. Fur…
New Encodings of Pseudo-Boolean Constraints into CNF
2009
International audience; This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudo-Boolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP). All previous encodings of PB constraints either did not allow UP to maintain GAC, or were of exponential size in the worst case. This paper presents an encoding that realizes both of the desired properties. From a theoretical point of view, this narrows the gap between the expressive power of clauses and the one of pseudo-Boolean constraints.
A recognize-and-accuse policy to speed up distributed processes
1994
Topic 5: Parallel and Distributed Data Management
2013
Nowadays we are facing an exponential growth of new data that is overwhelming the capabilities of companies, institutions and the society in general to manage and use it in a proper way. Ever-increasing investments in Big Data, cutting edge technologies and the latest advances in both application development and underlying storage systems can help dealing with data of such magnitude. Especially parallel and distributed approaches will enable new data management solutions that operate effectively at large scale.
"Efficiency in the SR3$\ell$ region with $\ell=$$\tau$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt{s}…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SR3$\ell$ region. Results are given as a function of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ mass and branching fraction to Z bosons, and are derived separately when requiring that the charged-lepton decays of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ are into $\tau$-leptons only
"Triangle, Efficiency in SR3$\ell$, $\ell=(e, \mu, \tau)$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SR3$\ell$ region for $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ masses of 700 GeV. Results are given as a function of the branching fractions to Z and Higgs bosons
"Triangle, Efficiency in SR4$\ell$, $\ell=(e, \mu, \tau)$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SR4$\ell$ region for $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ masses of 700 GeV. Results are given as a function of the branching fractions to Z and Higgs bosons
"Efficiency in the SRFR region with $\ell=$$\tau$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sqrt{s}$ = 1…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SRFR region. Results are given as a function of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ mass and branching fraction to Z bosons, and are derived separately when requiring that the charged-lepton decays of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ are into $\tau$-leptons only
"Efficiency in the SRFR region with $\ell=$$(e, \mu, \tau)$" of "Search for trilepton resonances from chargino and neutralino pair production in $\sq…
2021
The combined $\tilde\chi^{\pm}_{1}\tilde\chi^{\mp}_{1} + \tilde\chi^{\pm}_{1}\tilde\chi^{0}_{1}$ reconstruction efficiencies in the SRFR region. Results are given as a function of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ mass and branching fraction to Z bosons, and are derived separately when requiring that the charged-lepton decays of $\tilde\chi^{\pm}_{1}/\tilde\chi^{0}_{1}$ are into any leptons with equal probability