نتایج جستجو برای: cover classes

تعداد نتایج: 263011  

Journal: :Transportation Science 2017
Mervat Chouman Teodor Gabriel Crainic Bernard Gendron

We improve the mixed-integer programming formulation of the multicommodity capacitated fixed-charge network design problem by incorporating valid inequalities into a cutting-plane algorithm. We use five classes of valid inequalities: the strong, cover, minimum cardinality, flow cover, and flow pack inequalities. The first class is particularly useful when a disaggregated representation of the c...

2007
Michael Fellows Jörg Flum Danny Hermelin Moritz Müller Frances Rosamond

The classes of the W-hierarchy are the most important classes of intractable problems in parameterized complexity. These classes where originally defined via the weighted satisfiability problem for Boolean circuits. Here, besides the Boolean connectives we consider connectives like majority, not-all-equal, and unique. For example, a gate labelled by the majority connective outputs TRUE if more ...

2012
Diawo Diallo Amadou A. Sall Michaela Buenemann Rubing Chen Oumar Faye Cheikh T. Diagne Ousmane Faye Yamar Ba Ibrahima Dia Douglas Watts Scott C. Weaver Kathryn A. Hanley Mawlouth Diallo

The risk of human infection with sylvatic chikungunya (CHIKV) virus was assessed in a focus of sylvatic arbovirus circulation in Senegal by investigating distribution and abundance of anthropophilic Aedes mosquitoes, as well as the abundance and distribution of CHIKV in these mosquitoes. A 1650 km(2) area was classified into five land cover classes: forest, barren, savanna, agriculture and vill...

2017
EMILY BARNARD ANDREW T. CARROLL SHIJIE ZHU

Let Λ be a finite-dimensional associative algebra. The torsion classes of mod Λ form a lattice under containment, denoted by tors Λ. In this paper, we characterize the cover relations in tors Λ by certain indecomposable modules. We consider three applications: First, we show that the completely join-irreducible torsion classes (torsion classes which cover precisely one element) are in bijection...

2013
Stanimir Troyanski

Some new classes of compacta K are considered for which C(K) endowed with the pointwise topology has a countable cover by sets of small local norm–diameter.

2004
TIBOR BEKE

We introduce a notion of ‘cover of level n’ for a topological space, or more generally any Grothendieck site, with the key property that simplicial homotopy classes computed along the filtered diagram of n-covers biject with global homotopy classes when the target is an n-type. When the target is an Eilenberg–MacLane sheaf, this specializes to computing derived functor cohomology, up to degree ...

Journal: :IEEE Trans. Information Theory 1997
Alexander Goldenshluger Arkadi Nemirovski

The paper is devoted to spatial adaptive estimation of signals satisfying linear differential inequalities with an unknown differential operator of a given order. The classes of signals under consideration cover a wide variety of classes common to nonparametric regression. In particular, they contain the signals whose parameters of smoothness are not uniformly bounded, even locally. We develop ...

1996
A. Goldenshluger

The paper is devoted to developing spatial adaptive estimates of the signals satisfying linear differential inequalities with unknown differential operator of a given order. The classes of signals under consideration cover a wide variety of classes usual in the nonparametric regression problem; moreover, they contain the signals whose parameters of smoothness are not uniformly bounded, even loc...

ژورنال: :مرتع و آبخیزداری 2012
فاضل امیری حسن یگانه

assessment process of vegetation cover by remote-sensing images should be based on understanding of the vegetation indices. vegetation indices are widely used for assessing and monitoring ecological variables such as vegetation cover, above-ground biomass and leaf area index. the aim of the present research was to study of the aster data capabilities to estimate the vegetation cover percentage ...

2013
Michael Drmota Marc Noy

We analyze several extremal parameters like the diameter or the maximum degree in sub-critial graph classes. Sub-critical graph classes cover several well-known classes of graphs like trees, outerplanar graph or series-parallel graphs which have been intensively studied during the last few years. However, this paper is the first one, where these kind of parameters are studied from a general poi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید