70,753 Hits in 3.6 sec

Resolving Conflicts for Lower-Bounded Clustering

Katrin Casel, Michael Wagner
2019 International Symposium on Parameterized and Exact Computation  
We discuss lower-bounded clustering with the objective to minimise the maximum radius or diameter of the clusters.  ...  This paper considers the effect of non-metric distances for lower-bounded clustering, i.e., the problem of computing a partition for a given set of objects with pairwise distance, such that each set has  ...  This kind of reduction yields a lower bound for parameterised approximation of ( · ∞ , rad)-k-cluster under the assumption FPT = W [2] . 23:10 Resolving Conflicts for Lower-Bounded Clustering Figure  ... 
doi:10.4230/lipics.ipec.2018.23 dblp:conf/iwpec/Casel18 fatcat:rtod6ytbzbf4to34agtg42lyxu

Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster Editing [chapter]

Sepp Hartung, Holger H. Hoos
2015 Lecture Notes in Computer Science  
Notably, this 2k-vertex kernel is analysed empirically for the first time here.  ...  , improves over the performance of existing algorithms based on Integer Linear Programming (ILP) and branch-&-bound.  ...  how to resolve the conflict.  ... 
doi:10.1007/978-3-319-19084-6_5 fatcat:yq65bnk7m5e5zphfjqs2zpmhni

A practical exact maximum compatibility algorithm for reconstruction of recent evolutionary history

Joshua L. Cherry
2017 BMC Bioinformatics  
It may be ideal for certain applications, such as reconstructing phylogenies of closely-related bacteria on the basis of whole-genome sequencing.  ...  Conclusions: Maximum compatibility is a useful tool for certain phylogenetic problems, such as inferring the relationships among closely-related bacteria from whole-genome sequence data.  ...  Acknowledgements I thank Richa Agarwala for providing the data on which the algorithm was tested, and David Lipman for comments on the manuscript.  ... 
doi:10.1186/s12859-017-1520-4 pmid:28231758 pmcid:PMC5324209 fatcat:jbi6kifjrzftnawlrs3llfwxgu

Distributed computing column 54 transactional memory: models and algorithms

Jennifer L. Welch
2014 ACM SIGACT News  
First, work on transaction scheduling algorithms for tightly-coupled systems are surveyed.  ...  Third, related results for non-uniform memory access systems are surveyed, with emphasis on how to provide consistency in a load-balanced way.  ...  Welch for many thoughtful comments and suggestions on the earlier draft of this article.  ... 
doi:10.1145/2636805.2636823 fatcat:xnjbxycmfbfkdop6eyzrbbj4nq

The Role of Type and Source of Uncertainty on the Processing of Climate Models Projections

Daniel M. Benjamin, David V. Budescu
2018 Frontiers in Psychology  
The impacts of conflict and imprecision were combined for estimation tasks and compromised for feature ratings.  ...  Participants viewed three types of sets of sea-level rise projections: (1) precise, but conflicting; (2) imprecise, but agreeing, and (3) hybrid that were both conflicting and imprecise.  ...  Robert Lempert and Andrew Parker for useful conversations about the studies.  ... 
doi:10.3389/fpsyg.2018.00403 pmid:29636717 pmcid:PMC5881250 fatcat:pfj4z6msjffmjm44fst65ypzme

An improved method to transform triangular fuzzy number into basic belief assignment in evidence theory

Tianshuo Ma, Fuyuan Xiao
2019 IEEE Access  
After that, the conflicts will be resolved by using the discount coefficient method.  ...  First, the k-means++ clustering method is used to construct the target model.  ...  As for the upper and lower bound of generalized triangular fuzzy number, its lower bound is the higher value in lower bounds of two triangular fuzzy numbers, its upper bound is the lower value in upper  ... 
doi:10.1109/access.2019.2900362 fatcat:u5z3moowczgoremrnctqyycyh4

Exact Algorithms for Cluster Editing: Evaluation and Experiments

Sebastian Böcker, Sebastian Briesemeister, Gunnar W. Klau
2009 Algorithmica  
In particular, combining parameter-dependent data reduction with lower and upper bounds we can effectively reduce graphs satisfying k ≤ 25 |V |.  ...  We present empirical results for the Cluster Editing problem using exact methods from fixed-parameter algorithmics and linear programming.  ...  We thank Svenja Simon for support with evaluation and implementation. S.  ... 
doi:10.1007/s00453-009-9339-7 fatcat:nk6t7ouz6beetjoj6v3ht6a4su

Cosmological implications of two conflicting deuterium abundances

Naoya Hata, Gary Steigman, Sidney Bludman, Paul Langacker
1997 Physical Review D, Particles and fields  
When combined with the high baryon fraction inferred from x-ray observations of rich clusters, the corresponding total mass densities (for 50 \le H_0 \le 90) are Omega_M = 0.05 - 0.20 and Omega_M = 0.2  ...  Constraints on big bang nucleosynthesis (BBN) and on cosmological parameters from conflicting deuterium observations in different high red-shift QSO systems are discussed.  ...  The conict between the upper bound on M and the evidence for a lower bound DYN > 0:2 0:3 argue against high-D and low 10 (see Figs. 11 and 12) .  ... 
doi:10.1103/physrevd.55.540 fatcat:sy5z3c4v7rgplpttzklddfvadi

On optimal comparability editing with applications to molecular diagnostics

Sebastian Böcker, Sebastian Briesemeister, Gunnar W Klau
2009 BMC Bioinformatics  
Results: We present two new approaches for the problem based on fixed-parameter algorithmics and integer linear programming.  ...  Acknowledgements We thank Rainer Spang's group in Regensburg and, in particular, Juby Jacob for providing us with the data from [1] .  ...  Then, is a lower bound for solving all conflict triples in CT .  ... 
doi:10.1186/1471-2105-10-s1-s61 pmid:19208165 pmcid:PMC2648753 fatcat:k3gaws2ttjhrvdqppmjyjodtji

A Proposal of a Quasi-Solution State Evolution Algorithm for Channel Assignment Problems [chapter]

Nobuo Funabiki, Toru Nakanishi, Tokumi Yokohira, Shigeto Tajima, Teruo Higashino
2002 Lecture Notes in Computer Science  
The first stage computes the lower bound on the channel span.  ...  jump and the gradual span expansion for global convergence.  ...  The more accurate lower bound formula might clarify that the obtained solutions by QCAP are their real lower bounds.  ... 
doi:10.1007/3-540-45801-8_4 fatcat:itclqc6aijgjrgjmgvfrl2c6ve

Aircraft Trajectory Planning Under Uncertainty by Light Propagation

Nour Elhouda Dougui, Daniel Delahaye, Marcel Mongeau, Stéphane Puechmorel
2012 Procedia - Social and Behavioral Sciences  
For some situations, uncertainties reduce so much the search space that the standard algorithm cannot guarantee conflict free situation.  ...  As a consequence, one must include some time constraints for few trajectories (so-called RTA points: Real Time of Arrival constraints) in order to remove the remaining conflicts.  ...  -upperBound:= approximate lower bound of N. -remove from the tree all nodes whose approximate lower bounds are greater than upperBound. Else LaunchRays(N) (see Figure 1 ).  ... 
doi:10.1016/j.sbspro.2012.09.739 fatcat:vvaoxutsqfeq7ekdv4tgd7my7e

Towards adaptive state consistency in distributed SDN control plane

Ermin Sakic, Fragkiskos Sardis, Jochen W. Guck, Wolfgang Kellerer
2017 2017 IEEE International Conference on Communications (ICC)  
is employed for critical operations that affect a large portion of the network resources while less critical changes are periodically propagated across cluster nodes.  ...  For large deployments, this blocking process increases the delay of state synchronisation across cluster members and consequently has a detrimental effect on network operations that require rapid response  ...  It can then retrieve the current state of other cluster participants to identify and resolve the conflict. Externally activated Triggers.  ... 
doi:10.1109/icc.2017.7997164 dblp:conf/icc/SakicSGK17 fatcat:fu6i2bajajft3lhc46bnneigbm

A register file and scheduling model for application specific processor synthesis

E. Ercanli, C. Papachristou
1996 Proceedings of the 33rd annual conference on Design automation conference - DAC '96  
In this paper, we outline general design steps of our synthesis tool to realize application specific co-processors such that for a given scientific application having intensive iterative computations especially  ...  We introduce a novel register file model, Shifting Register File (SRF), based on cyclic regularity of register file accesses; and a simple method, Expansion Scheduling, for scheduling iterative computations  ...  Since it did not resolve any conflicts, operation 11 is shifted up, which resolves one conflict, this is shown in the third instance.  ... 
doi:10.1145/240518.240525 dblp:conf/dac/ErcanliP96 fatcat:ktlx4z72jzc6foazsp2lhessmm

System Performance Characteristics of Centralized and Decentralized Air Traffic Separation Strategies

Jimmy Krozel, Mark Peters, Karl D. Bilimoria, Changkil Lee, Joseph S.B. Mitchell
2001 Air Traffic Control Quarterly  
This work investigates the system performance characteristics of centralized and decentralized strategies for air traffic separation.  ...  Results from numerical experiments indicate that system stability and efficiency both degrade as traffic density increases, for all separation strategies.  ...  Acknowledgments Work by Jimmy Krozel and Mark Peters was funded by NASA Ames Research Center under Task Order 36 of contract NAS2-98005 for the Advanced Air Transportation Technologies (AATT) program.  ... 
doi:10.2514/atcq.9.4.311 fatcat:hstakha7z5frbchdfp5tqcbety

The Crisis Confronting Standard Big Bang Nucleosynthesis [article]

Gary Steigman
1996 arXiv   pre-print
In this contribution, the written version of the material I discussed at the Princeton University "Critical Dialogues in Cosmology" (June 1996), I will present the case for a conflict and show how recent  ...  I conclude with a brief description of an alternate, "dynamical" approach to bounding the nucleon density which may be of some value given the current deuterium dichotomy.  ...  , 8] ) to bound the primordial D abundance from above, leading to a lower bound to η (η 10 ≥ 2.8) [1] .  ... 
arXiv:astro-ph/9608084v1 fatcat:vkbkfd22srcffchw3fomgnxame
« Previous Showing results 1 — 15 out of 70,753 results