Results 1  10
of
1,072,662
Feasible Set
, 2004
"... endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution m ..."
Abstract
 Add to MetaCart
endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubspermissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
On Stability of the MPCC Feasible Set
, 2008
"... The feasible set of mathematical programs with complementarity constraints (MPCC) is considered. We discuss local stability of the feasible set with respect to perturbations (up to first order) of the defining functions. Here, stability refers to homeomorphy invariance under small perturbations. F ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The feasible set of mathematical programs with complementarity constraints (MPCC) is considered. We discuss local stability of the feasible set with respect to perturbations (up to first order) of the defining functions. Here, stability refers to homeomorphy invariance under small perturbations
Feasible Sets of Pattern Hypergraphs
, 2002
"... A pattern (Π_1, ... Π_λ)hypergraph H is a hypergraph (V, E) with edge types Π_i; each of Π_i is a set of equivalences. Each edge of H is assigned one of the edge types Π_i. A coloring c of H is proper if for each Π_iedge E the color classes of c ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
of c on E form an equivalence which is contained in the type Π_i. The feasible set of H is the set of all k's for which there is a proper coloring using exactly k colors. We prove a simple sufficient and...
On the Feasible Sets of Products of bihypergraphs
"... Abstract—In this paper, we discuss respectively the relationships between the feasible sets of the Weak product, the Cartesian product and the disjunctive product of uniform bihypergraphs and the feasible sets of the factors. Keywords hypergraph coloring; mixed hypergraph; feasible set; onerealiz ..."
Abstract
 Add to MetaCart
Abstract—In this paper, we discuss respectively the relationships between the feasible sets of the Weak product, the Cartesian product and the disjunctive product of uniform bihypergraphs and the feasible sets of the factors. Keywords hypergraph coloring; mixed hypergraph; feasible set; one
On Feasible Sets of Mixed Hypergraphs
, 2004
"... A mixed hypergraph H is a triple (V,C, D)whereV is the vertex set and are families of subsets of V , called Dedges. ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
A mixed hypergraph H is a triple (V,C, D)whereV is the vertex set and are families of subsets of V , called Dedges.
Group Formation with Heterogeneous Feasible Sets
, 2004
"... In this paper we consider a model of group formation where group of individuals may have different feasible sets. We focus on two polar cases, increasing returns, when the set of feasible alternatives increases if a new member joins the group, and decreasing returns, when a new member has an opposit ..."
Abstract
 Add to MetaCart
In this paper we consider a model of group formation where group of individuals may have different feasible sets. We focus on two polar cases, increasing returns, when the set of feasible alternatives increases if a new member joins the group, and decreasing returns, when a new member has
ON REPRESENTATIONS OF THE FEASIBLE SET IN CONVEX OPTIMIZATION
, 2010
"... We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1,..., m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the functions gj’s are not necessarily convex. We show that for any representation of K that satisfies a mild nondegeneracy assumption, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1,..., m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the functions gj’s are not necessarily convex. We show that for any representation of K that satisfies a mild nondegeneracy assumption
Construction of power flow feasibility sets
"... Abstract—We develop a new approach for construction of convex analytically simple regions where the AC power flow equations are guaranteed to have a feasible solutions. Construction of these regions is based on efficient semidefinite programming techniques accelerated via sparsity exploiting algori ..."
Abstract
 Add to MetaCart
Abstract—We develop a new approach for construction of convex analytically simple regions where the AC power flow equations are guaranteed to have a feasible solutions. Construction of these regions is based on efficient semidefinite programming techniques accelerated via sparsity exploiting
Using the feasible set method for rezoning in ALE
"... www.elsevier.com/locate/procedia One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is essential for maintaining a mesh that does not become invalid during a simulation. In th ..."
Abstract
 Add to MetaCart
. In this paper, we present a new robust and computationally efficient 2D mesh relaxation method. This feasible set method is a geometric method for finding the convex polygon that represents the region of coordinates that a vertex in a mesh can occupy while the mesh around it remains valid. After the feasible
Mining Association Rules between Sets of Items in Large Databases
 IN: PROCEEDINGS OF THE 1993 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, WASHINGTON DC (USA
, 1993
"... We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel esti ..."
Abstract

Cited by 3260 (17 self)
 Add to MetaCart
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.
Results 1  10
of
1,072,662