Log in

Relevant bibliographies by topics / Mapping Problem / Journal articles

Journal articles on the topic 'Mapping Problem'

To see the other types of publications on this topic, follow the link: Mapping Problem.

Author: Grafiati

Published: 4 June 2021

Last updated: 7 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Mapping Problem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Thien, Nguyen Duc, Le Hoang Son, Pier Luca Lanzi, and Pham Huy Thong. "Heuristic Optimization Algorithms for Terrain Splitting and Mapping Problem." International Journal of Engineering and Technology 3, no. 4 (2011): 376–83. http://dx.doi.org/10.7763/ijet.2011.v3.255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Sergeyeva, I. S. "MAPPING GLOBAL PROBLEMS OF TODAY: THE FOOD PROBLEM." Mapping Sciences and Remote Sensing 27, no. 1 (January 1990): 38–50. http://dx.doi.org/10.1080/07493878.1990.10641788.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Fu, Xiao-Ming, Jian-Ping Su, Zheng-Yu Zhao, Qing Fang, Chunyang Ye, and Ligang Liu. "Inversion-free geometric mapping construction: A survey." Computational Visual Media 7, no. 3 (July 27, 2021): 289–318. http://dx.doi.org/10.1007/s41095-021-0233-9.

Full text

Abstract:

AbstractA geometric mapping establishes a correspondence between two domains. Since no real object has zero or negative volume, such a mapping is required to be inversion-free. Computing inversion-free mappings is a fundamental task in numerous computer graphics and geometric processing applications, such as deformation, texture mapping, mesh generation, and others. This task is usually formulated as a non-convex, nonlinear, constrained optimization problem. Various methods have been developed to solve this optimization problem. As well as being inversion-free, different applications have various further requirements. We expand the discussion in two directions to (i) problems imposing specific constraints and (ii) combinatorial problems. This report provides a systematic overview of inversion-free mapping construction, a detailed discussion of the construction methods, including their strengths and weaknesses, and a description of open problems in this research field.

APA, Harvard, Vancouver, ISO, and other styles

4

Ali, Bashir, and M. H. Harbau. "Convergence Theorems for BregmanK-Mappings and Mixed Equilibrium Problems in Reflexive Banach Spaces." Journal of Function Spaces 2016 (2016): 1–18. http://dx.doi.org/10.1155/2016/5161682.

Full text

Abstract:

We introduce a new mixed equilibrium problem with a relaxed monotone mapping in a reflexive Banach space and prove the existence of solution of the equilibrium problem. Using Bregman distance, we introduce the concept of BregmanK-mapping for a finite family of Bregman quasiasymptotically nonexpansive mappings and show the fixed point set of the BregmanK-mapping is the set of common fixed points of{Ti}i=1N. Using the BregmanK-mapping, we introduce an iterative sequence for finding a common point in the set of a common fixed points of the finite family of Bregman quasiasymptotically nonexpansive mappings and the set of solutions of some mixed equilibrium problems. Strong convergence of the iterative sequence is proved. Our results generalise and improve many recent results in the literature.

APA, Harvard, Vancouver, ISO, and other styles

5

Kent, Stuart, and Robert Smith. "The Bidirectional Mapping Problem." Electronic Notes in Theoretical Computer Science 82, no. 7 (June 2003): 151–65. http://dx.doi.org/10.1016/s1571-0661(04)80753-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Harrison, Jenny. "The loxodromic mapping problem." Journal of Differential Equations 90, no. 1 (March 1991): 136–42. http://dx.doi.org/10.1016/0022-0396(91)90164-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kantere, Verena, Dimos Bousounis, and Timos Sellis. "Mapping Discovery Over Revealing Schemas." International Journal of Cooperative Information Systems 24, no. 04 (December 2015): 1550006. http://dx.doi.org/10.1142/s0218843015500069.

Full text

Abstract:

In a world of wide-scale information sharing, data are described in different formats, i.e. data structures, values and schemas. Querying such sources entails techniques that can bridge the data formats. Some existing techniques deal with schema mapping and view complementary aspects of the problem. Important ones, consider producing all the possible mappings for a pair of schemas, insinuating accompanying semantics in the mappings and adapting correct mappings as schemas evolve. In this work, we consider the problem of discovering mappings as schemas of autonomous sources are gradually revealed. Using as an example setting an overlay of peer databases, we present a schema mapping solution that discovers correct mappings as peer schemas are gradually revealed to remote peers. Mapping discovery is schema-centric and incorporates new semantics as they are unveiled. Mapping experience is reused and possible mappings are ranked so that the best choice is presented to the user. The experimental study confirms the suitability of the proposed solution to dynamic settings of heterogeneous sources.

APA, Harvard, Vancouver, ISO, and other styles

8

Kangtunyakarn, Atid. "A New Iterative Algorithm for the Set of Fixed-Point Problems of Nonexpansive Mappings and the Set of Equilibrium Problem and Variational Inequality Problem." Abstract and Applied Analysis 2011 (2011): 1–24. http://dx.doi.org/10.1155/2011/562689.

Full text

Abstract:

We introduce a new iterative scheme and a new mapping generated by infinite family of nonexpansive mappings and infinite real number. By using both of these ideas, we obtain strong convergence theorem for finding a common element of the set of solution of equilibrium problem and the set of variational inequality and the set of fixed-point problems of infinite family of nonexpansive mappings. Moreover, we apply our main result to obtain strong convergence theorems for finding a common element of the set of solution of equilibrium problem and the set of variational inequality and the set of common fixed point of pseudocontractive mappings.

APA, Harvard, Vancouver, ISO, and other styles

9

O’Gorman, Bryan, Eleanor Gilbert Rieffel, Minh Do, Davide Venturelli, and Jeremy Frank. "Comparing planning problem compilation approaches for quantum annealing." Knowledge Engineering Review 31, no. 5 (November 2016): 465–74. http://dx.doi.org/10.1017/s0269888916000278.

Full text

Abstract:

AbstractOne approach to solving planning problems is to compile them to other problems for which powerful off-the-shelf solvers are available; common targets include SAT, CSP, and MILP. Recently, a novel optimization technique has become available: quantum annealing (QA). QA takes as input problem instances of quadratic unconstrained binary optimization (QUBO) problem. Early quantum annealers are now available, though their constraints restrict the types of QUBOs they can take as input. Here, we introduce the planning community to the key steps in compiling planning problems to QA hardware: a hardware-independent step, mapping, and a hardware-dependent step, embedding. After describing two approaches to mapping general planning problems to QUBO, we describe preliminary results from running an early quantum annealer on a parametrized family of hard planning problems. The results show that different mappings can substantially affect performance, even when many features of the resulting instances are similar. We conclude with insights gained from this early study that suggest directions for future work.

APA, Harvard, Vancouver, ISO, and other styles

10

Dranishnikov, Alexander. "On the mapping intersection problem." Pacific Journal of Mathematics 173, no. 2 (April 1, 1996): 403–12. http://dx.doi.org/10.2140/pjm.1996.173.403.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Pandurangan, Gopal, and H. Ramesh. "The restriction mapping problem revisited." Journal of Computer and System Sciences 65, no. 3 (November 2002): 526–44. http://dx.doi.org/10.1016/s0022-0000(02)00008-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Vinoski, S. "It's just a mapping problem." IEEE Internet Computing 7, no. 3 (May 2003): 88–90. http://dx.doi.org/10.1109/mic.2003.1200306.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Keane, Mark T. "On Adaptation in Analogy: Tests of Pragmatic Importance and Adaptability in Analogical Problem Solving." Quarterly Journal of Experimental Psychology Section A 49, no. 4 (November 1996): 1062–85. http://dx.doi.org/10.1080/713755671.

Full text

Abstract:

When people use analogies to solve problems, they form an analogical mapping between two domains of knowledge. This mapping may support inferences by analogy that suggest a novel solution to a problem. Several factors have been proposed to be important in selecting this mapping from among several alternative mappings: structural factors (systematicity and structural consistency) and pragmatic factors (the exploitation of higher-order planning categories). We suggest another set of factors plays a role in selecting mappings: adaptability. Specifically, if a mapped solution can be adapted easily to a problem, then it will be preferred over an alternative mapping that is less adaptable. Two experiments are reported which test the effects of pragmatic and adaptation factors, using a novel technique in which the story analogue has two alternative plans, either of which can be used to solve an insight problem. In Experiment 1, these plans were varied in terms of their pragmatic importance (success or failure) and their adaptability. In Experiment 2, the relative adaptability of plans was manipulated. The results suggest that there is little evidence for these specific pragmatic factors, but that adaptability plays a definite role in selecting an analogous plan. The findings suggest that most models need to be extended to include adaptation constraints.

APA, Harvard, Vancouver, ISO, and other styles

14

Bell, S. "Mapping problems in complex analysis and the $\overline \partial$-problem." Bulletin of the American Mathematical Society 22, no. 2 (April 1, 1990): 233–60. http://dx.doi.org/10.1090/s0273-0979-1990-15879-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Szeberényi, József. "Problem-solving test: Restriction endonuclease mapping." Biochemistry and Molecular Biology Education 39, no. 5 (September 2011): 393–95. http://dx.doi.org/10.1002/bmb.20547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Kress, R. "Inverse Dirichlet problem and conformal mapping." Mathematics and Computers in Simulation 66, no. 4-5 (July 2004): 255–65. http://dx.doi.org/10.1016/j.matcom.2004.02.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Vallée-Tourangeau, Frédéric, and Gaëlle Vallée-Tourangeau. "Mapping systemic resources in problem solving." New Ideas in Psychology 59 (December 2020): 100812. http://dx.doi.org/10.1016/j.newideapsych.2020.100812.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Schiefermayr, K. "Zolotarev's conformal mapping and Chebotarev's problem." Integral Transforms and Special Functions 26, no. 2 (October 30, 2014): 118–33. http://dx.doi.org/10.1080/10652469.2014.973195.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Barbey, Aron K., Roberto Colom, Erick J. Paul, Aileen Chau, Jeffrey Solomon, and Jordan H. Grafman. "Lesion mapping of social problem solving." Brain 137, no. 10 (July 27, 2014): 2823–33. http://dx.doi.org/10.1093/brain/awu207.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

ARUNKUMAR, S., and T. CHOCKALINGAM. "RANDOMIZED HEURISTICS FOR THE MAPPING PROBLEM." International Journal of High Speed Computing 04, no. 04 (December 1992): 289–99. http://dx.doi.org/10.1142/s0129053392000134.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Francis, Gregory, Keri Bias, and Joshua Shive. "The psychological four-color mapping problem." Journal of Experimental Psychology: Applied 16, no. 2 (2010): 109–23. http://dx.doi.org/10.1037/a0019095.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Choi, Jae Kyu, Hyoung Suk Park, Shuai Wang, Yi Wang, and Jin Keun Seo. "Inverse Problem in Quantitative Susceptibility Mapping." SIAM Journal on Imaging Sciences 7, no. 3 (January 2014): 1669–89. http://dx.doi.org/10.1137/140957433.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Cole, Steven. "Venus mapping delayed by Magellan problem." Eos, Transactions American Geophysical Union 71, no. 36 (1990): 1059. http://dx.doi.org/10.1029/eo071i036p01059-01.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Chern, Shiing-Shen, and Shanyu Ji. "Projective geometry and Riemann's mapping problem." Mathematische Annalen 302, no. 1 (May 1995): 581–600. http://dx.doi.org/10.1007/bf01444509.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Dryer, Stuart E. "Mismatch problem in receptor mapping studies." Trends in Neurosciences 8 (January 1985): 522. http://dx.doi.org/10.1016/0166-2236(85)90187-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Hildebrandt, Stefan. "Plateau’s Problem and Riemann’s Mapping Theorem." Milan Journal of Mathematics 79, no. 1 (June 2011): 67–79. http://dx.doi.org/10.1007/s00032-011-0142-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Sachkov, Yu L., and E. F. Sachkova. "Exponential Mapping in Euler’s Elastic Problem." Journal of Dynamical and Control Systems 20, no. 4 (March 26, 2014): 443–64. http://dx.doi.org/10.1007/s10883-014-9211-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Poliquin, R. A. "A Characterization of Proximal Subgradient Set-Valued Mappings." Canadian Mathematical Bulletin 36, no. 1 (March 1, 1993): 116–22. http://dx.doi.org/10.4153/cmb-1993-017-4.

Full text

Abstract:

AbstractIn this paper we tackle the problem of identifying set-valued mappings that are subgradient set-valued mappings. We show that a set-valued mapping is the proximal subgradient mapping of a lower semicontinuous function bounded below by a quadratic if and only if it satisfies a monotone selection property.

APA, Harvard, Vancouver, ISO, and other styles

29

Serpeloni, Felipe, Regina Moraes, and Rodrigo Bonacin. "Ontology Mapping Validation." International Journal of Web Portals 3, no. 3 (July 2011): 1–11. http://dx.doi.org/10.4018/jwp.2011070101.

Full text

Abstract:

The use of ontologies and ontology mappings is increasing in companies. Often the same context is modeled in different ontologies. Mapping is necessary to integrate these ontologies; however, in many cases these mappings are incorrect, i.e., they incorrectly link semantic concepts with different meanings. Tools that validate these mappings are necessary to ensure reliable communication between heterogeneous systems. This validation cannot be done in a completely automatic way, because the mappings are based on human interpretation. This work describes a semi-automatic tool that supports this activity, based on graphs that generate instances validated in a semi-automatic process that aims to ensure mapping robustness. This algorithm deals with an NP-Complete problem in order to generate all the instances. This paper presents a first prototype of the tool and the methodology used to validate the instances automatically generated by the tool.

APA, Harvard, Vancouver, ISO, and other styles

30

Roy, Subhro, and Dan Roth. "Mapping to Declarative Knowledge for Word Problem Solving." Transactions of the Association for Computational Linguistics 6 (December 2018): 159–72. http://dx.doi.org/10.1162/tacl_a_00012.

Full text

Abstract:

Math word problems form a natural abstraction to a range of quantitative reasoning problems, such as understanding financial news, sports results, and casualties of war. Solving such problems requires the understanding of several mathematical concepts such as dimensional analysis, subset relationships, etc. In this paper, we develop declarative rules which govern the translation of natural language description of these concepts to math expressions. We then present a framework for incorporating such declarative knowledge into word problem solving. Our method learns to map arithmetic word problem text to math expressions, by learning to select the relevant declarative knowledge for each operation of the solution expression. This provides a way to handle multiple concepts in the same problem while, at the same time, supporting interpretability of the answer expression. Our method models the mapping to declarative knowledge as a latent variable, thus removing the need for expensive annotations. Experimental evaluation suggests that our domain knowledge based solver outperforms all other systems, and that it generalizes better in the realistic case where the training data it is exposed to is biased in a different way than the test data.

APA, Harvard, Vancouver, ISO, and other styles

31

Amrizal, Dedi, and Yusriati Yusriati. "Implementation of Mind Mapping Learning Methods in Efforts to Improve the Research and Examination of Seminars on the College of Public Policy Seminar as FISIP UMSU Products." Budapest International Research and Critics Institute (BIRCI-Journal) : Humanities and Social Sciences 1, no. 3 (October 18, 2018): 23–34. http://dx.doi.org/10.33258/birci.v1i3.28.

Full text

Abstract:

Teaching Grant using mind mapping method is expected to be a reference in improving the learning system in public policy seminar courses in the Faculty of Political Science (FISIP), especially the State Administration Study Program (IAN). The low condition of mastery of the problem and the lack of ability to explain problems at the time of the seminar practice in this public policy seminar course made researchers interested in offering new learning methods with the name mind mapping that prioritizes images and signs for mapping research problems as well as can be used to help The student explained the research problem more clearly during the thesis proposal seminar. This study aims to assist students in finding research problems properly, improving students' ability in formulating problems and explaining problems in public policy seminars and ultimately expected to improve the quality of seminars and the quality of student answers in public policy seminars. The results showed that in the first cycle there was no significant development of the students involved so it was necessary to do a second cycle with the addition and improvement when training and making mind mapping and presentation. Finally in the second cycle, it can be seen that there are changes and improvements in the making of mind mapping and it can be seen that students find it easier to explain the research problem compared to mind mapping learning methods that can increase students' mastery of research problems and can facilitate them in explaining the problems at the seminar. Although the final achievement of the first cycle still shows confusion and low mastery of the mind mapping theory, in the second cycle there is a change in the mastery of theory and mind mapping (students realize that mind mapping cannot be done if they do not master the research problem correctly) so when explaining the problem of research in front of the class when the seminar practice takes place can be done better. In general, the use of mind mapping in public policy seminar courses is very useful and helps students in formulating research problems, making a research background, presenting a research background in the form of a power point containing mind mapping. And the most important thing is that mind mapping helps students in explaining the research problem at the time the seminar was held.

APA, Harvard, Vancouver, ISO, and other styles

32

Ceng, Lu-Chuan, and Qing Yuan. "Hybrid Mann Viscosity Implicit Iteration Methods for Triple Hierarchical Variational Inequalities, Systems of Variational Inequalities and Fixed Point Problems." Mathematics 7, no. 2 (February 2, 2019): 142. http://dx.doi.org/10.3390/math7020142.

Full text

Abstract:

In the present work, we introduce a hybrid Mann viscosity-like implicit iteration to find solutions of a monotone classical variational inequality with a variational inequality constraint over the common solution set of a general system of variational inequalities and a problem of common fixed points of an asymptotically nonexpansive mapping and a countable of uniformly Lipschitzian pseudocontractive mappings in Hilbert spaces, which is called the triple hierarchical constrained variational inequality. Strong convergence of the proposed method to the unique solution of the problem is guaranteed under some suitable assumptions. As a sub-result, we provide an algorithm to solve problem of common fixed points of pseudocontractive, nonexpansive mappings, variational inequality problems and generalized mixed bifunction equilibrium problems in Hilbert spaces.

APA, Harvard, Vancouver, ISO, and other styles

33

Chamnarnpan, Tanom, and Poom Kumam. "Iterative Algorithms for Solving the System of Mixed Equilibrium Problems, Fixed-Point Problems, and Variational Inclusions with Application to Minimization Problem." Journal of Applied Mathematics 2012 (2012): 1–29. http://dx.doi.org/10.1155/2012/538912.

Full text

Abstract:

We introduce a new iterative algorithm for solving a common solution of the set of solutions of fixed point for an infinite family of nonexpansive mappings, the set of solution of a system of mixed equilibrium problems, and the set of solutions of the variational inclusion for aβ-inverse-strongly monotone mapping in a real Hilbert space. We prove that the sequence converges strongly to a common element of the above three sets under some mild conditions. Furthermore, we give a numerical example which supports our main theorem in the last part.

APA, Harvard, Vancouver, ISO, and other styles

34

Salvucci, Dario D., and John R. Anderson. "Integrating analogical mapping and general problem solving: the path-mapping theory." Cognitive Science 25, no. 1 (January 2001): 67–110. http://dx.doi.org/10.1207/s15516709cog2501_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Hunt, Andy, and Marcelo M. Wanderley. "Mapping performer parameters to synthesis engines." Organised Sound 7, no. 2 (August 2002): 97–108. http://dx.doi.org/10.1017/s1355771802002030.

Full text

Abstract:

This paper considers the issues involved in the design of electronic and computer interfaces, specifically mapping - the designed link between an instrument's playing interface and its sound source. It defines the problem area, reviews the literature, and gives examples of specific system mappings. A general model is presented, with the aim of providing a framework for future discussions on what makes an effective mapping. Several guidelines for mapping strategies are given, based on existing work.

APA, Harvard, Vancouver, ISO, and other styles

36

KHAN, ABDUL RAHIM, MUJAHID ABBAS, and YEKINI SHEHU. "A general convergence theorem for multiple-set split feasibility problem in Hilbert spaces." Carpathian Journal of Mathematics 31, no. 3 (2015): 349–57. http://dx.doi.org/10.37193/cjm.2015.03.11.

Full text

Abstract:

We establish strong convergence result of split feasibility problem for a family of quasi-nonexpansive multi-valued mappings and a total asymptotically strict pseudo-contractive mapping in infinite dimensional Hilbert spaces.

APA, Harvard, Vancouver, ISO, and other styles

37

Mlaiki, Nabil, Ufuk Çelik, Nihal Taş, Nihal Yilmaz Özgür, and Aiman Mukheimer. "Wardowski Type Contractions and the Fixed-Circle Problem on S-Metric Spaces." Journal of Mathematics 2018 (October 10, 2018): 1–9. http://dx.doi.org/10.1155/2018/9127486.

Full text

Abstract:

In this paper, we present new fixed-circle theorems for self-mappings on an S-metric space using some Wardowski type contractions, ψ-contractive, and weakly ψ-contractive self-mappings. The common property in all of the obtained theorems for Wardowski type contractions is that the self-mapping fixes both the circle and the disc with the center x0 and the radius r.

APA, Harvard, Vancouver, ISO, and other styles

38

Zuo, Zhanfei. "Common Fixed-Point Problem for a Family Multivalued Mapping in Banach Space." International Journal of Mathematics and Mathematical Sciences 2011 (2011): 1–9. http://dx.doi.org/10.1155/2011/459085.

Full text

Abstract:

It is our purpose in this paper to prove two convergents of viscosity approximation scheme to a common fixed point of a family of multivalued nonexpansive mappings in Banach spaces. Moreover, it is the unique solution in to a certain variational inequality, where stands for the common fixed-point set of the family of multivalued nonexpansive mapping .

APA, Harvard, Vancouver, ISO, and other styles

39

Villaseñor, Carlos, Nancy Arana-Daniel, Alma Alanis, Carlos Lopez-Franco, and Javier Gomez-Avila. "Multiellipsoidal Mapping Algorithm." Applied Sciences 8, no. 8 (July 27, 2018): 1239. http://dx.doi.org/10.3390/app8081239.

Full text

Abstract:

The robotic mapping problem, which consists in providing a spatial model of the environment to a robot, is a research topic with a wide range of applications. One important challenge of this problem is to obtain a map that is information-rich (i.e., a map that preserves main structures of the environment and object shapes) yet still has a low memory cost. Point clouds offer a highly descriptive and information-rich environmental representation; accordingly, many algorithms have been developed to approximate point clouds and lower the memory cost. In recent years, approaches using basic and “simple” (i.e., using only planes or spheres) geometric entities for approximating point clouds have been shown to provide accurate representations at low memory cost. However, a better approximation can be implemented if more complex geometric entities are used. In the present paper, a new object-mapping algorithm is introduced for approximating point clouds with multiple ellipsoids and other quadratic surfaces. We show that this algorithm creates maps that are rich in information yet low in memory cost and have features suitable for other robotics problems such as navigation and pose estimation.

APA, Harvard, Vancouver, ISO, and other styles

40

Wangkeeree, Rabian, and Panu Yimmuang. "Existence and Iterative Approximation Methods for Generalized Mixed Vector Equilibrium Problems with Relaxed Monotone Mappings." Journal of Applied Mathematics 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/973408.

Full text

Abstract:

We first consider an auxiliary problem for the generalized mixed vector equilibrium problem with a relaxed monotone mapping and prove the existence and uniqueness of the solution for the auxiliary problem. We then introduce a new iterative scheme for approximating a common element of the set of solutions of a generalized mixed vector equilibrium problem with a relaxed monotone mapping and the set of common fixed points of a countable family of nonexpansive mappings. The results presented in this paper can be considered as a generalization of some known results due to Wang et al. (2010).

APA, Harvard, Vancouver, ISO, and other styles

41

Zhukovskaya, Zukhra T., and Sergey E. Zhukovskiy. "On the existence of a continuously diﬀerentiable solution to the Cauchy problem for implicit diﬀerential equations." Russian Universities Reports. Mathematics, no. 128 (2019): 376–83. http://dx.doi.org/10.20310/2686-9667-2019-24-128-376-383.

Full text

Abstract:

We study the question of the existence of a solution to the Cauchy problem for a diﬀerential equation unsolved with respect to the derivative of the unknown function. Diﬀerential equations generated by twice continuously diﬀerentiable mappings are considered. We give an example showing that the assumption of regularity of the mapping at each point of the domain is not enough for the solvability of the Cauchy problem. The concept of uniform regularity for the considered mappings is introduced. It is shown that the assumption of uniform regularity is suﬃcient for the local solvability of the Cauchy problem for any initial point in the class of continuously diﬀerentiable functions. It is shown that if the mapping deﬁning the diﬀerential equation is majorized by mappings of a special form, then the solution of the Cauchy problem under consideration can be extended to a given time interval. The case of the Lipschitz dependence of the mapping deﬁning the equation on the phase variable is considered. For this case, estimates of non-extendable solutions of the Cauchy problem are found. The results are compared with known ones. It is shown that under the assumptions of the proved existence theorem, the uniqueness of a solution may fail to hold. We provide examples llustrating the importance of the assumption of uniform regularity.

APA, Harvard, Vancouver, ISO, and other styles

42

MECHE, TESFALEM HADUSH, MENGISTU GOA SANGAGO, and HABTU ZEGEYE. "Iterative methods for a fixed point of hemicontractive-type mapping and a solution of a variational inequality problem." Creative Mathematics and Informatics 25, no. 2 (June 30, 2016): 183–96. http://dx.doi.org/10.37193/cmi.2016.02.10.

Full text

Abstract:

In this paper, we introduce and study an iterative process for finding a common point of the fixed point set of a Lipschitz hemicontractive-type multi-valued mapping and the solution set of a variational inequality problem for a monotone mapping. Our results improve and extend most of the results that have been proved for this class of nonlinear mappings.

APA, Harvard, Vancouver, ISO, and other styles

43

Bryzgalina, Elena. "Bioethics of Pandemia: Mapping the Problem Area." Chelovek 31, no. 4 (2020): 41. http://dx.doi.org/10.31857/s023620070010930-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Savin, I. Yu. "THE SCALE PROBLEM IN MODERN SOIL MAPPING." Dokuchaev Soil Bulletin, no. 97 (June 18, 2019): 5–20. http://dx.doi.org/10.19047/0136-1694-2019-97-5-20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Heath, Lenwood S., Arnold L. Rosenberg, and Bruce T. Smith. "The physical mapping problem for parallel architectures." Journal of the ACM 35, no. 3 (June 1988): 603–34. http://dx.doi.org/10.1145/44483.44489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Hu, Shaohan, Peng Liu, ChunFu Richard Chen, Marco Pistoia, and Jay Gambetta. "Reduction-Based Problem Mapping for Quantum Computing." Computer 52, no. 6 (June 2019): 47–57. http://dx.doi.org/10.1109/mc.2019.2909709.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Sanen, Frans, Eddy Truyen, and Wouter Joosen. "Mapping problem-space to solution-space features." ACM SIGPLAN Notices 45, no. 2 (February 2010): 167–76. http://dx.doi.org/10.1145/1837852.1621633.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Iwaniec, Tadeusz, Leonid V. Kovalev, and Jani Onninen. "The harmonic mapping problem and affine capacity." Proceedings of the Royal Society of Edinburgh: Section A Mathematics 141, no. 5 (September 26, 2011): 1017–30. http://dx.doi.org/10.1017/s0308210510000107.

Full text

Abstract:

The harmonic mapping problem asks when there exists a harmonic homeomorphism between two given domains. It arises in the theory of minimal surfaces and in the calculus of variations, specifically in hyperelasticity theory. We investigate this problem for doubly connected domains in the plane, where it already presents a considerable challenge and leads to several interesting open questions.

APA, Harvard, Vancouver, ISO, and other styles

49

Rosson, M. B., and E. Gold. "Problem-solution mapping in object-oriented design." ACM SIGPLAN Notices 24, no. 10 (October 1989): 7–10. http://dx.doi.org/10.1145/74878.74880.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Stoyanov, Slavi, and Piet Kommers. "Concept mapping instrumental support for problem solving." International Journal of Continuing Engineering Education and Life-Long Learning 18, no. 1 (2008): 40. http://dx.doi.org/10.1504/ijceell.2008.016075.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!