نتایج جستجو برای: cesaro supermodular order

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

Journal: :CoRR 2017
Ayumi Igarashi Rani Izsak Edith Elkind

Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation should be shared among the players. Unfortunately, computational problems associated with many of these solution concepts tend to be intractable—NP-hard or worse. In this paper, we incorporate complexity measures recently...

Journal: :Discrete Applied Mathematics 2005
David A. Cohen Martin C. Cooper Peter Jeavons Andrei A. Krokhin

In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. An instance of Max CSP consists of a set of variables and a collection of constraints which are applied to certain specified subsets of these variables; the goal is to find values for the variables which maximize the number of simultaneously satisfied constraints. Usin...

Journal: :Journal of Combinatorial Theory 1969

1999
Vardges Melkonian Éva Tardos

We present a 4-approximation algorithm for a class of directed network design problems. The network design problem is to find a minimum cost subgraph such that for each vertex set S there are at least f(S) arcs leaving the set S. In the last 10 years general techniques have been developed for designing approximation algorithms for undirected network design problems. Recently, Kamal Jain gave a ...

2016
Tobias Gäbel-Hökenschnieder Thorsten Pfeiffer Mosadak Al Salamat Stefan E. Schmidt

We provide an approach to generalized metrics that covers various concepts of distance. In particular, we consider functorial maps which are weakly positive. Here, we focus on the supermodular case which generalizes dimension functions. We give a lattice-theoretically based construction for supermodular functorial maps, which generalize those arising from Dempster-Shafer-Theory. Within this fra...

Journal: :CoRR 2018
Wenruo Bai Jeffrey A. Bilmes

We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two types of constraints, either a cardinality constraint or p ≥ 1 matroid independence constraints. These problems occur naturally in several real-world applica...

2005
V. TEVZADZE

Some pointwise properties of (C,α) kernel (−1 < α < 0) with respect to the Walsh–Paley system are established.

2014
Marin Marin Olivia Florea Olivia FLOREA

We consider a porous thermoelastic body, including voidage time derivative among the independent constitutive variables. For the initial boundary value problem of such materials, we analyze the temporal behaviour of the solutions. To this aim we use the Cesaro means for the components of energy and prove the asymptotic equipartition in mean of the kinetic and strain energies.

Journal: :Math. Meth. of OR 2008
Nicole Bäuerle Anja Blatter Alfred Müller

In this paper we investigate dependence properties and comparison results for multidimensional Lévy processes. In particular we address the questions, whether or not dependence properties and orderings of the copulas of the distributions of a Lévy process can be characterized by corresponding properties of the Lévy copula, a concept which has been introduced recently in Cont and Tankov (2004) a...

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

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