Results 21 to 30 of about 3,117,048 (238)
Size constrained unequal probability sampling with a non-integer sum of inclusion probabilities [PDF]
, 2012 More than 50 methods have been developed to draw unequal probability samples with fixed sample size. All these methods require the sum of the inclusion probabilities to be an integer number.
Grafström, Anton +3 more
core +1 more source
Deciding Entailments in Inductive Separation Logic with Tree Automata [PDF]
, 2014 Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures.
A. Bouajjani +11 more
core +2 more sources
General Split Variational Inclusion Problem in Hilbert Spaces
Abstract and Applied Analysis, 2014 We consider a general split variational inclusion problem (GSFVIP) and propose an algorithm for finding the solutions of GSFVIP in Hilbert space. We establish the strong convergence of the proposed algorithm to a solution of GSFVIP.
Li Yang, Fu Hai Zhao
doaj +1 more source
Relaxed η-proximal Operator for Solving a Variational-Like Inclusion Problem
Mathematical Modelling and Analysis, 2015 In this paper, we introduce a new resolvent operator and we call it relaxed η-proximal operator. We demonstrate some of the properties of relaxed η- proximal operator.
Mijanur Rahaman +3 more
doaj +1 more source
Selecting analogous problems: Similarity versus inclusiveness [PDF]
Memory & Cognition, 1990 Students were asked to select one of two analogous problems in order to solve algebra word problems. In Experiment 1, one problem was less inclusive and the other was more inclusive than a test problem. The students judged the complexity and similarity of problems, selected analogous problems, and used the solutions to solve test problems.
S K, Reed, C C, Ackinclose, A A, Voss
openaire +2 more sources
Inclusion Relationships Among Permutation Problems
Discrete Applied Mathematics, 1987 Let \(X=\{x_ 1,...,x_ n\}\) be a set of n elements. A permutation problem on X is a decision problem in NP which consists of determining whether there exists an n element permutation satisfying a set of ordering constraints expressed as collections of permutations of at most k elements of X.
Bovet, Daniel P, Panconesi, Alessandro
openaire +2 more sources
The HOM problem is EXPTIME-complete [PDF]
, 2016 We define a new class of tree automata with constraints and prove decidability of the emptiness problem for this class in exponential time. As a consequence, we obtain several EXPTIME-completeness results for problems on images of regular tree languages ...
Creus López, Carles +3 more
core +2 more sources
Differential Inclusions and Target Problems [PDF]
SIAM Journal on Control and Optimization, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
MathematicsThis paper examines H(·,·)-accretive mappings in Banach spaces and proves that the resolvent operator related to these mappings is Lipschitz continuous.
Mohd Aftab Alam +2 more
doaj +1 more source
Mathematics, 2022 The main aim of this research is to introduce and investigate an inertial Tseng iterative method to approximate a common solution for the variational inequality problem for γ-inverse strongly monotone mapping and monotone inclusion problem in real ...
Shamshad Husain +4 more
doaj +1 more source