منابع مشابه
Upgrading Bottleneck Constrained Forests
We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each link emanating from v. The goal is to nd a minimum cost set of nodes to be upgraded so that the resulting network has a good performance. The performance is measured by the bottleneck weight of a con...
متن کاملConstrained Matroidal Bottleneck Problems
Algorithms for the constrained bottleneck matroid base problem and the constrained bottleneck independent set problem are presented. The algorithms have improved complexities upon the best known general algorithm. Sufficient conditions are obtained when the proposed algorithms have linear complexity and are therefore the best possible ones. Several specific classes of matroidal problems are con...
متن کاملDiscrete profile alignment via constrained information bottleneck
Amino acid profiles, which capture position-specific mutation probabilities, are a richer encoding of biological sequences than the individual sequences themselves. However, profile comparisons are much more computationally expensive than discrete symbol comparisons, making profiles impractical for many large datasets. Furthermore, because they are such a rich representation, profiles can be di...
متن کاملThe Research on the Bottleneck of Liaoning Equipment Manufacturing Industry Technology Upgrading
In this paper, aiming at the problems of backward overall technology, weak competitiveness, poor operation efficiency and low production and economic efficiency in Liaoning equipment manufacturing industry, we based on the theory of constrains and used the DEA model to research its technology upgrading input and output efficiency to find its bottleneck, and then analysis its cause, finally put ...
متن کاملConstrained Semantic Forests for Improved Discriminative Semantic Parsing
In this paper, we present a model for improved discriminative semantic parsing. The model addresses an important limitation associated with our previous stateof-the-art discriminative semantic parsing model – the relaxed hybrid tree model by introducing our constrained semantic forests. We show that our model is able to yield new state-of-the-art results on standard datasets even with simpler f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00222-5