To see the other types of publications on this topic, follow the link: Problem solving - Computer programs.

Journal articles on the topic 'Problem solving - Computer programs'

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 'Problem solving - Computer programs.'

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

Erkens, Gijsbert, and Jerry E. B. Andriessen. "Cooperation in problem solving and educational computer programs." Computers in Human Behavior 10, no. 1 (March 1994): 107–25. http://dx.doi.org/10.1016/0747-5632(94)90032-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kahn, Arthur. "Problem Solving Training — A Factor in Debugging Computer Programs." Proceedings of the Human Factors Society Annual Meeting 29, no. 9 (October 1985): 856–60. http://dx.doi.org/10.1177/154193128502900906.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Baum, Eric B., and Igor Durdanovic. "Evolution of Cooperative Problem Solving in an Artificial Economy." Neural Computation 12, no. 12 (December 1, 2000): 2743–75. http://dx.doi.org/10.1162/089976600300014700.

Full text
Abstract:
We address the problem of how to reinforce learning in ultracomplex environments, with huge state-spaces, where one must learn to exploit a compact structure of the problem domain. The approach we propose is to simulate the evolution of an artificial economy of computer programs. The economy is constructed based on two simple principles so as to assign credit to the individual programs for collaborating on problem solutions. We find empirically that starting from programs that are random computer code, we can develop systems that solve hard problems. In particular, our economy learned to solve
APA, Harvard, Vancouver, ISO, and other styles
4

Thilmany, Jean. "Probabilistic Problem Solving." Mechanical Engineering 124, no. 01 (January 1, 2002): 53–55. http://dx.doi.org/10.1115/1.2002-jan-4.

Full text
Abstract:
This article reviews predictive technologies based on a probabilistic method of problem solving. These technologies are gaining a steady foothold as a method of finding answers to engineering and other types of problems. According to the developer of one such technology, these computer programs use mathematical models to predict the probability that something will or won’t happen a particular way in the future. The tools can be used for design, sensitivity analysis, mathematical modeling of complex processes, uncertainty analysis, competitive analysis, and process optimization among other thin
APA, Harvard, Vancouver, ISO, and other styles
5

COOKE, DANIEL E., and ANN GATES. "ON THE DEVELOPMENT OF A METHOD TO SYNTHESIZE PROGRAMS FROM REQUIREMENTS SPECIFICATIONS." International Journal of Software Engineering and Knowledge Engineering 01, no. 01 (March 1991): 21–38. http://dx.doi.org/10.1142/s0218194091000056.

Full text
Abstract:
This paper reviews the progress that has been made towards the definition of a new generation of computer assisted problem solving tool. When we solve problems with a computer we state the solution in terms of several languages, beginning with a requirements specification language and ending with a program. Beginning with a generalization of a programming language, this paper follows steps towards the removal of control and data structure information in a problem solution. The effort discussed here would result in the requirements specification language being the final language used in problem
APA, Harvard, Vancouver, ISO, and other styles
6

Lamia, Mahnane, and Hafidi Mohamed. "A Problem Solving Using Intelligent Social Network." International Journal of Web-Based Learning and Teaching Technologies 14, no. 3 (July 2019): 28–38. http://dx.doi.org/10.4018/ijwltt.2019070103.

Full text
Abstract:
Nowadays, students are becoming familiar with the computer technology at a very early age. Moreover, the wide availability of the internet gives a new perspective to distance education making e-learning environments crucial to the future of education. Intelligent tutoring systems (ITSs) provide sophisticated tutoring systems using artificial intelligence techniques in computer programs to facilitate instruction. ITSs support problem solving by providing adaptive scaffolding in terms of feedback, guidance, problem selection and other types of help. Little attention has been devoted thus far to
APA, Harvard, Vancouver, ISO, and other styles
7

Titus, S. J., and W. S. Adams. "A Fifth Generation Approach to Problem-Solving in Forest Mensuration and Sampling." Forestry Chronicle 64, no. 3 (June 1, 1988): 186–89. http://dx.doi.org/10.5558/tfc64186-3.

Full text
Abstract:
A new problem-solving methodology, based on fifth generation computer programming languages, is presented for use in forestry or other technically-oriented fields. It is based on the integration of exposition, data, and computer programs into a single document that is processed by the computer to produce a report. With this methodology the report, a text file, provides a central focus for the problem-solving process as it happens rather than being a reconstruction after the fact. The methodology exploits the capability of a fifth generation language, the Nested Interactive Array Language (Nial
APA, Harvard, Vancouver, ISO, and other styles
8

RUBY, DAVID, and DENNIS KIBLER. "LEARNING STEPPINGSTONES FOR PROBLEM SOLVING." International Journal of Pattern Recognition and Artificial Intelligence 07, no. 03 (June 1993): 527–40. http://dx.doi.org/10.1142/s0218001493000273.

Full text
Abstract:
One goal of Artificial Intelligence is to develop and understand computational mechanisms for solving difficult real-world problems. Unfortunately, domains traditionally used in general problem-solving research lack important characteristics of real-world domains, making it difficult to apply the techniques developed. Most classic AI domains require satisfying a set of Boolean constraints. Real-world problems require finding a solution that meets a set of Boolean constraints and performs well on a set of real-valued constraints. In addition, most classic domains are static while domains from t
APA, Harvard, Vancouver, ISO, and other styles
9

Armoni, Michal, Judith Gal-Ezer, and Dina Tirosh. "Solving Problems Reductively." Journal of Educational Computing Research 32, no. 2 (March 2005): 113–29. http://dx.doi.org/10.2190/6pcm-447v-wf7b-qeuf.

Full text
Abstract:
Solving problems by reduction is an important issue in mathematics and science education in general (both in high school and in college or university) and particularly in computer science education. Developing reductive thinking patterns is an important goal in any scientific discipline, yet reduction is not an easy subject to cope with. Still, the use of reduction usually is insufficiently reflected in high school mathematics and science programs. Even in academic computer science programs the concept of reduction is mentioned explicitly only in advanced academic courses such as computability
APA, Harvard, Vancouver, ISO, and other styles
10

DiMatteo, Rachel Wing. "Informing Practice: A Model Approach to Problem Solving." Mathematics Teaching in the Middle School 16, no. 3 (October 2010): 132–35. http://dx.doi.org/10.5951/mtms.16.3.0132.

Full text
Abstract:
Students who pursue careers in business, medicine, engineering, or architecture need robust mathematical backgrounds, with a particularly strong emphasis on problem solving. For example, when civil engineers are asked to determine the best placement for a cell phone tower, some of their thinking is related to schoolbased mathematical procedures and concepts. However, for the most part, they problem solve, using computer programs to construct mathematical models that relate the three-dimensional topography of the earth and the availability and cost of property for tower placement.
APA, Harvard, Vancouver, ISO, and other styles
11

Ilyasova, R. A., A. U. Dauletkulova, and D. Ya Tokhtakhunov. "SYSTEMS OF COMPUTER-ORIENTED PROBLEMS IN THE COURSE OF DIFFERENTIAL EQUATIONS." BULLETIN Series of Physics & Mathematical Sciences 69, no. 1 (March 10, 2020): 351–55. http://dx.doi.org/10.51889/2020-1.1728-7901.62.

Full text
Abstract:
The modern period of development of the information society is characterized by the need to modernize the education system. The training of a future mathematics teacher should be organized in such a way that in addition to basic knowledge, future teachers should master various applications of mathematics, be able to model various processes and phenomena, and use modern information technologies in the process of solving mathematical problems. The use of computers and computer programs in the educational process changes the role of learning tools in teaching. In our study, we consider the comput
APA, Harvard, Vancouver, ISO, and other styles
12

Zaurebekov, N. S., and А. М. Bodyk. "MAPLE AND MATHCAD PROGRAMMING METHODS FOR SOLVING MATH PROBLEMS." BULLETIN Series of Physics & Mathematical Sciences 69, no. 1 (March 10, 2020): 333–39. http://dx.doi.org/10.51889/2020-1.1728-7901.59.

Full text
Abstract:
The article discusses the features of teaching computer science and mathematics in secondary schools based on interdisciplinary communication. Integration of mathematics and computer science contributes to the algorithmic thinking of students in the process of solving logical, textual, arithmetic, geometric problems. The main didactic task of interdisciplinary communication is to establish a connection between the educational, educational, developing nature of the educational process. The use of computer programs to solve problems related to mathematics, the use of computers to accelerate stud
APA, Harvard, Vancouver, ISO, and other styles
13

Ganian, Robert, and Sebastian Ordyniak. "Solving Integer Linear Programs by Exploiting Variable-Constraint Interactions: A Survey." Algorithms 12, no. 12 (November 22, 2019): 248. http://dx.doi.org/10.3390/a12120248.

Full text
Abstract:
Integer Linear Programming (ILP) is among the most successful and general paradigms for solving computationally intractable optimization problems in computer science. ILP is NP-complete, and until recently we have lacked a systematic study of the complexity of ILP through the lens of variable-constraint interactions. This changed drastically in recent years thanks to a series of results that together lay out a detailed complexity landscape for the problem centered around the structure of graphical representations of instances. The aim of this survey is to summarize these recent developments, p
APA, Harvard, Vancouver, ISO, and other styles
14

A.V., Chistyakov. "On improving the efficiency of mathematical modeling of the problem of stability of construction." Artificial Intelligence 25, no. 3 (October 10, 2020): 27–36. http://dx.doi.org/10.15407/jai2020.03.027.

Full text
Abstract:
Algorithmic software for mathematical modeling of structural stability is considered, which is reduced to solving a partial generalized eigenvalues problem of sparse matrices, with automatic parallelization of calculations on modern parallel computers with graphics processors. Peculiarities of realization of parallel algorithms for different structures of sparse matrices are presented. The times of solving the problem of stability of composite materialsusing a three-dimensional model of "finite size fibers" on computers of different architectures are given. In mathematical modeling of physical
APA, Harvard, Vancouver, ISO, and other styles
15

Stadler, Matthias, Katharina Herborn, Maida Mustafić, and Samuel Greiff. "Computer-Based Collaborative Problem Solving in PISA 2015 and the Role of Personality." Journal of Intelligence 7, no. 3 (July 1, 2019): 15. http://dx.doi.org/10.3390/jintelligence7030015.

Full text
Abstract:
Collaborative problem solving (CPS) is an essential 21st century skill at the intersection of social collaboration and cognitive problem solving, and is increasingly integrated in educational programs, such as the influential Programme for International Student Assessment (PISA). As research has identified the impact of the Big Five personality traits either on cognitive ability or social collaboration skills in groups, this study firstly identified their impact on the conjoint construct of CPS. Results from structural equation modelling (N = 483) found openness to experience and agreeableness
APA, Harvard, Vancouver, ISO, and other styles
16

Reznik, A. L., A. A. Soloviev, and A. V. Torgov. "Programs of Recursive Analytical Calculations in Problems of Random Point Images Analysis." Izvestiya of Altai State University, no. 4(114) (September 9, 2020): 112–16. http://dx.doi.org/10.14258/izvasu(2020)4-18.

Full text
Abstract:
The paper discusses an approach to solving complex probabilistic combinatorial problems. The approach is based on the use of specialized software systems for analytical transformations for computing systems. One of the problems associated with the partition of the interval (which arises in the study of the reliability of reading discrete-point fields and digital images) is considered in the paper, and new previously unknown analytical formulas have been successfully obtained. The efficiency of the developed software systems is ensured by two factors: firstly, the development of high-speed spec
APA, Harvard, Vancouver, ISO, and other styles
17

EITER, THOMAS, and AXEL POLLERES. "Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications." Theory and Practice of Logic Programming 6, no. 1-2 (January 2006): 23–60. http://dx.doi.org/10.1017/s1471068405002577.

Full text
Abstract:
Answer set programming (ASP) with disjunction offers a powerful tool for declaratively representing and solving hard problems. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise and intuitive way, where the encoding reflects the typical “guess and check” nature of NP problems: The property is encoded in a way such that polynomial size certificates for it correspond to stable models of a program. However, the problem-solving capacity of full disjunctive logic programs (DLPs) is beyond NP, and captures a class of problems at the second level
APA, Harvard, Vancouver, ISO, and other styles
18

Petrov, K., N. Petrov, and M. Mikrenska. "A computer program for solving Signorini's contact problem with friction." Advances in Engineering Software 19, no. 2 (January 1994): 97–108. http://dx.doi.org/10.1016/0965-9978(94)90063-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Goel, Ashok K., Spencer Rugaber, and Swaroop Vattam. "Structure, behavior, and function of complex systems: The structure, behavior, and function modeling language." Artificial Intelligence for Engineering Design, Analysis and Manufacturing 23, no. 1 (December 16, 2008): 23–35. http://dx.doi.org/10.1017/s0890060409000080.

Full text
Abstract:
AbstractTeleological modeling is fundamental to understanding and explaining many complex systems, especially engineered systems. Research on engineering design and problem solving has developed several ontologies for expressing teleology, for example, functional representation, function–behavior–structure, and structure–behavior–function (SBF). In this paper, we view SBF as a programming language. SBF models of engineering systems have been used in several computer programs for automated design and problem solving. The SBF language captures the expressive power of the earlier programs and pro
APA, Harvard, Vancouver, ISO, and other styles
20

Yurgaytis, Alexey, and Kamol Kamolov. "Automation of production programs by setting conditions of stabilization of the planned system." E3S Web of Conferences 258 (2021): 09062. http://dx.doi.org/10.1051/e3sconf/202125809062.

Full text
Abstract:
Formation of a production program is a time-consuming variable problem. To solve it, many conditions and constraints must be taken into account. Computer power allows one to quickly and accurately solve problems with many variables, unlike a person who relies on his intuition and experience. The following materials and methods were used: collection and analysis of data from construction companies of various sizes, mathematical modeling of the processes of distributing labor resources, graphic interpretation of information, computer modeling. The stages of the problem statement: description of
APA, Harvard, Vancouver, ISO, and other styles
21

Shi, Hai He, and Hai Peng Shi. "Deductive Synthesis of Algorithms in Human-Computer Interaction." Applied Mechanics and Materials 610 (August 2014): 312–15. http://dx.doi.org/10.4028/www.scientific.net/amm.610.312.

Full text
Abstract:
Deductive synthesis is a method of software development where an algorithm is derived from a formal problem specification which guarantees the reliability of final product. The paper introduces a program synthesis method PAR most of whose synthesis steps are mechanical and some of them can be done interactively by human-computer interaction, and formally synthesizes a dependable algorithm for a selection problem supported by PAR method and PAR platform. Program synthesis based on PAR covers a number of classical algorithm design tactics, develops algorithmic programs together with their proof
APA, Harvard, Vancouver, ISO, and other styles
22

Ryan, Kevin, Shabbir Ahmed, Santanu S. Dey, Deepak Rajan, Amelia Musselman, and Jean-Paul Watson. "Optimization-Driven Scenario Grouping." INFORMS Journal on Computing 32, no. 3 (July 2020): 805–21. http://dx.doi.org/10.1287/ijoc.2019.0924.

Full text
Abstract:
Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. We develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed group
APA, Harvard, Vancouver, ISO, and other styles
23

Pratama, Heri, Sofika Enggari, and Irzal Arief Wisky. "Sistem Pakar Deteksi Kerusakan Truk Mitsubishi Fuso Berbasis Desktop." Jurnal Teknologi 11, no. 1 (April 12, 2021): 1–4. http://dx.doi.org/10.35134/jitekin.v11i1.23.

Full text
Abstract:
An expert system is a computer program that can mimic the thought process and expert knowledge in solving a particular problem. The implementation of this expert system is widely used in the field of artificial intelligence because expert systems are seen as a way of storing expert knowledge in certain fields in computer programs so that decisions can be made in making intelligent reasoning on a specific problem in this case the problem of detecting damage to Mitsubishi trucks. Fuso at Berdikari Motor Sibolga workshop.
APA, Harvard, Vancouver, ISO, and other styles
24

Browning, Mark E., and James D. Lehman. "Identification of student misconceptions in genetics problem solving via computer program." Journal of Research in Science Teaching 25, no. 9 (December 1988): 747–61. http://dx.doi.org/10.1002/tea.3660250905.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Jelinek, Jan Amos. "Strategies of solving tasks while using the multimedia computer program by 7-year-old students." International Journal of Pedagogy, Innovation and New Technologies 3, no. 2 (December 29, 2016): 38–46. http://dx.doi.org/10.5604/01.3001.0009.5098.

Full text
Abstract:
Both in the classroom as well as on the computer screen pupils can apply similar strategies of dealing with tasks (with difficult situation). For this reason multimedia programs for learning mathematics treated are as educational alternative manner of the forming amongst children abilities of solving problems. Domain of computer programs is better adapting the level of difficulty of tasks to individual possibilities of each of users. It seems that contemporary multimedia programs are effective (Kaczmarek, 2003; Watoła, 2006; Raszka, 2008). However from conducted research which are taking into
APA, Harvard, Vancouver, ISO, and other styles
26

Abboud, May C. "Problem Solving and Program Design: A Pedagogical Approach." Computer Science Education 5, no. 1 (January 1994): 63–83. http://dx.doi.org/10.1080/0899340940050105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

KESH, DEEPANJAN, and SHASHANK K. MEHTA. "GENERALIZED REDUCTION TO COMPUTE TORIC IDEALS." Discrete Mathematics, Algorithms and Applications 02, no. 01 (March 2010): 45–59. http://dx.doi.org/10.1142/s1793830910000462.

Full text
Abstract:
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since it is an NP hard problem the present approaches can only solve relatively small problems. We propose a new approach which improves upon a well known technique to compute ideal saturation, which leads to a faster algorithm to compute toric ideals.
APA, Harvard, Vancouver, ISO, and other styles
28

Glivenko, E. V., and A. S. Fomochkina. "COMPARISON STUDY OF GEOMETRIC METHODS FOR SOLVING EQUATION SYSTEMS." Issues of radio electronics, no. 5 (June 8, 2019): 116–23. http://dx.doi.org/10.21778/2218-5453-2019-5-116-123.

Full text
Abstract:
The paper proposes a comparison of computational methods for solving nonlinear systems of equations on the example of the problem of calculating the spatial trajectory of a horizontal well. The difference of the proposed methods is the geometric approach to the formulation and solution of the problem. Brief algorithms and descriptions of computer programs of three geometric methods are presented: the «exit into (n + 1)‑dimensional space» method, the method using the fixed‑point properties and the unifying method. The application of each of these algorithms to the problem of calculating the spa
APA, Harvard, Vancouver, ISO, and other styles
29

Junaedi, Nanang, and Candra Budi Susila. "Pelatihan Microsoft Office 2007 di Desa Sukosari, Kecamatan Dagangan, Kabupaten Madiun." JURNAL DAYA-MAS 5, no. 1 (June 2, 2020): 22–26. http://dx.doi.org/10.33319/dymas.v5i1.37.

Full text
Abstract:
Information Technology has grown rapidly in Indonesia. Almost all problems can be handled by a computer. For this reason, every level of society must be ready and able to follow along with the development of technology. After the development of information technology, typewriter users moved to the computer. Because of its more efficient performance. Now almost all people must have switched from being manually switched to computers, nowadays performance is demanded to be faster in solving a problem. Correspondence is a problem that is often handled by computer administrators in order to become
APA, Harvard, Vancouver, ISO, and other styles
30

Horst, R., T. Q. Phong, Ng V. Thoai, and J. de Vries. "On solving a D.C. programming problem by a sequence of linear programs." Journal of Global Optimization 1, no. 2 (June 1991): 183–203. http://dx.doi.org/10.1007/bf00119991.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Nuraida, Ida, Hamdan Sugilar, Rahayu Kariadinata, Juariah Juariah, and Nunung Sobarningsih. "Solving the heart curve with geogebra." MATEC Web of Conferences 197 (2018): 01001. http://dx.doi.org/10.1051/matecconf/201819701001.

Full text
Abstract:
Heart symbols are used as expressions of love. There are several mathematical explanations that can produce a curve in the shape of a heart symbol, the most famous of which is cardioid. Graphs that look exotic like cardioid and limacon can be solved using polar coordinates. Polar equations r = a ± b cos θ and r = a ± b sin θ, with a and b positive are called limacon curves, for the special case a = b is called the cardiod. Computer technology is an alternative that can be used to help this. One of the computer programs that can be utilized as a medium of mathematics learning especially in draw
APA, Harvard, Vancouver, ISO, and other styles
32

Clement, Catherine A., D. Midian Kurland, Ronald Mawby, and Roy D. Pea. "Analogical Reasoning and Computer Programming." Journal of Educational Computing Research 2, no. 4 (November 1986): 473–86. http://dx.doi.org/10.2190/dfh5-e0pg-1ml4-m34j.

Full text
Abstract:
Investigations of the cognitive demands of programming can inform teaching and validate claims that important cognitive skills are inherent in programming. Given reports of experts' use of analogical problem solving in programming, the study reported here related analogical reasoning to Logo programming mastery among high school students. Correlational analyses related pretests of analogical reasoning to posttests of programming mastery. As predicted, a significant correlation was found between analogical reasoning and the ability to write subprocedures which can be reused for several differen
APA, Harvard, Vancouver, ISO, and other styles
33

Cai, Lei, Shuai Tang, Jingben Yin, Zhisong Hou, and Hongwei Jiao. "An Out Space Accelerating Algorithm for Generalized Affine Multiplicative Programs Problem." Journal of Control Science and Engineering 2017 (2017): 1–7. http://dx.doi.org/10.1155/2017/5249160.

Full text
Abstract:
This paper presents an out space branch-and-bound algorithm for solving generalized affine multiplicative programs problem. Firstly, by introducing new variables and constraints, we transform the original problem into an equivalent nonconvex programs problem. Secondly, by utilizing new linear relaxation technique, we establish the linear relaxation programs problem of the equivalent problem. Thirdly, based on the out space partition and the linear relaxation programs problem, we construct an out space branch-and-bound algorithm. Fourthly, to improve the computational efficiency of the algorith
APA, Harvard, Vancouver, ISO, and other styles
34

Hasan, M. Babul, and SM Asaduzzaman. "A Computer Program for Solving LP Problems by 2-Basic Variables Replacement at Each Simplex Iteration." Dhaka University Journal of Science 61, no. 1 (May 27, 2013): 13–18. http://dx.doi.org/10.3329/dujs.v61i1.15090.

Full text
Abstract:
In this paper, we develop a computer technique to implement the existing 2-basic variable replacement method of Paranjape for solving linear programming (LP) problems. To our knowledge there is no such computer oriented program which implemented Paranjape’s method. Our computer oriented program is a faster method for solving linear programs. A number of numerical examples are illustrated to demonstrate our algorithm. Dhaka Univ. J. Sci. 61(1): 13-18, 2013 (January) DOI: http://dx.doi.org/10.3329/dujs.v61i1.15090
APA, Harvard, Vancouver, ISO, and other styles
35

Baggio, Andrea, Margarida Carvalho, Andrea Lodi, and Andrea Tramontani. "Multilevel Approaches for the Critical Node Problem." Operations Research 69, no. 2 (March 2021): 486–508. http://dx.doi.org/10.1287/opre.2020.2014.

Full text
Abstract:
Multilevel programming can provide the right mathematical formulations for modeling sequential decision-making problems. In such cases, it is implicit that each level anticipates the optimal reaction of the subsequent ones. Defender–attacker–defender trilevel programs are a particular case of interest that encompasses a fortification strategy, followed by an attack, and a consequent recovery defensive strategy. In “Multilevel Approaches for the Critical Node Problem,” Baggio, Carvalho, Lodi, and Tramontani study a combinatorial sequential game between a defender and an attacker that takes plac
APA, Harvard, Vancouver, ISO, and other styles
36

EITER, THOMAS, MICHAEL FINK, THOMAS KRENNWALLNER, and CHRISTOPH REDL. "Conflict-driven ASP solving with external sources." Theory and Practice of Logic Programming 12, no. 4-5 (July 2012): 659–79. http://dx.doi.org/10.1017/s1471068412000233.

Full text
Abstract:
AbstractAnswer Set Programming (ASP) is a well-known problem solving approach based on nonmonotonic logic programs and efficient solvers. To enable access to external information,hex-programs extend programs withexternal atoms, which allow for a bidirectional communication between the logic program and external sources of computation (e.g., description logic reasoners and Web resources). Current solvers evaluatehex-programs by a translation to ASP itself, in which values of external atoms are guessed and verified after the ordinary answer set computation. This elegant approach does not scale w
APA, Harvard, Vancouver, ISO, and other styles
37

Ahmadi, Amir Ali, and Bachir El Khadir. "Time-Varying Semidefinite Programs." Mathematics of Operations Research 46, no. 3 (August 2021): 1054–80. http://dx.doi.org/10.1287/moor.2020.1117.

Full text
Abstract:
We study time-varying semidefinite programs (TV-SDPs), which are semidefinite programs whose data (and solutions) are functions of time. Our focus is on the setting where the data vary polynomially with time. We show that under a strict feasibility assumption, restricting the solutions to also be polynomial functions of time does not change the optimal value of the TV-SDP. Moreover, by using a Positivstellensatz (positive locus theorem) on univariate polynomial matrices, we show that the best polynomial solution of a given degree to a TV-SDP can be found by solving a semidefinite program of tr
APA, Harvard, Vancouver, ISO, and other styles
38

Gogodze, Joseph. "Ranking Methods for Multicriteria Decision-Making: Application to Benchmarking of Solvers and Problems." Scientific Programming 2021 (July 11, 2021): 1–14. http://dx.doi.org/10.1155/2021/5513860.

Full text
Abstract:
Evaluating the performance assessments of solvers (e.g., for computation programs), known as the solver benchmarking problem, has become a topic of intense study, and various approaches have been discussed in the literature. Such a variety of approaches exist because a benchmark problem is essentially a multicriteria problem. In particular, the appropriate multicriteria decision-making problem can correspond naturally to each benchmark problem and vice versa. In this study, to solve the solver benchmarking problem, we apply the ranking-theory method recently proposed for solving multicriteria
APA, Harvard, Vancouver, ISO, and other styles
39

Shi, Dongwei, Jingben Yin, and Chunyang Bai. "An Effective Global Optimization Algorithm for Quadratic Programs with Quadratic Constraints." Symmetry 11, no. 3 (March 22, 2019): 424. http://dx.doi.org/10.3390/sym11030424.

Full text
Abstract:
This paper will present an effective algorithm for globally solving quadratic programs with quadratic constraints. In this algorithm, we propose a new linearization method for establishing the linear programming relaxation problem of quadratic programs with quadratic constraints. The proposed algorithm converges with the global optimal solution of the initial problem, and numerical experiments show the computational efficiency of the proposed algorithm.
APA, Harvard, Vancouver, ISO, and other styles
40

AIBA, AKIRA, KAZUMASA YOKOTA, and HIROSHI TSUDA. "HETEROGENEOUS DISTRIBUTED COOPERATIVE PROBLEM SOLVING SYSTEM HELIOS AND ITS COOPERATION MECHANISMS." International Journal of Cooperative Information Systems 04, no. 04 (December 1995): 369–85. http://dx.doi.org/10.1142/s0218843095000160.

Full text
Abstract:
For advanced and complicated knowledge processing, we need to integrate various kinds of problem-solvers such as constraint solvers, databases, and application programs. A heterogeneous distributed cooperative problem solving system HELIOS achieves this integration by introducing capsule and environment modules. To integrate heterogeneous problem-solvers that may be implemented in different languages and may have different knowledge representations, those heterogeneity should be absorbed. Capsules and environments are introduced into HELIOS for this purpose. A capsule surrounds each problem-so
APA, Harvard, Vancouver, ISO, and other styles
41

Bouajjani, Ahmed, Javier Esparza, and Tayssir Touili. "A Generic Approach to the Static Analysis of Concurrent Programs with Procedures." International Journal of Foundations of Computer Science 14, no. 04 (August 2003): 551–82. http://dx.doi.org/10.1142/s0129054103001893.

Full text
Abstract:
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow problems for this model are undecidable, because the emptiness problem for the intersection of context-free languages, which is undecidable, can be reduced to them. In this paper we propose an algebraic framework for defining abstractions (upper approximations) of context-free languages. We consider two classes of abstractions: finite-chain abstractions, which are abstractions whose domains do not contain any infinite
APA, Harvard, Vancouver, ISO, and other styles
42

Jordaan, Annelie, and Dawid Jordaan. "A logical and structural thinking development tool (LST) to enhance fundamental problem-solving skills of learners of information technology." Journal for Transdisciplinary Research in Southern Africa 1, no. 1 (May 17, 2005): 18. http://dx.doi.org/10.4102/td.v1i1.303.

Full text
Abstract:
The role of information technology in modern education has increased significantly over the past two decades [14]. The opportunity to develop an interactive software system with the aim of enhancing fundamental problem-solving skills of learners enrolled for the Computer Science, Information Technology and Mathematics programs at tertiary institutions is possible with object-oriented programming techniques and multi-dimensional graphic design. The definition of fundamental problem-solving skills includes cognitive functional skills such as logical thinking, conceptualism with prior knowledge,
APA, Harvard, Vancouver, ISO, and other styles
43

Holoubek, Josef, and Petr Zach. "Using Excel to reduce a Square Matrix." Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis 60, no. 4 (2012): 109–14. http://dx.doi.org/10.11118/actaun201260040109.

Full text
Abstract:
When solving operations research problems, one can use either specialised computer programs such as Lingo, Lindo, Storm or more universal programs such Excel, Matlab, and R. To obtain the input data, one can use either a program’s own editor or other programs commonly available such as Excel. While the problem-solving methods, being part of various programs, are the subjects of numerous publications (such as Gros, 2003; Jablonský, 2002; Plevný – Žižka, 2007; Stevenson – Ozgur, 2009), the way the input data are obtained, recorded, and processed receives far less attention although this part of
APA, Harvard, Vancouver, ISO, and other styles
44

Chugreyev, Vsevolod, Vadim Kaikov, and Tatiana Kapitonova. "Graphic programming by elements of nonstandard structural forms." SHS Web of Conferences 44 (2018): 00024. http://dx.doi.org/10.1051/shsconf/20184400024.

Full text
Abstract:
The article describes one of the variants for solving the actual practical problem on information building modeling with application of several computer programs. The authors showed the relationship between graphic programming and model parameterization using specifications. The main purpose of the work was to show the algorithm for designing an architectural and construction object from the choice of the conceptual form to obtaining the information required for the industrial production of parts. The authors note the importance of studying similar problems in the framework of training courses
APA, Harvard, Vancouver, ISO, and other styles
45

Louër, Michèle, and Daniel Louër. "The Use of PCs for AB Initio Structure Determination From Powder Diffraction Data." Advances in X-ray Analysis 37 (1993): 21–25. http://dx.doi.org/10.1154/s0376030800015470.

Full text
Abstract:
The determination ab initio of crystal structures from powder diffraction data has been the most striking advance of modern powder crystallography. It is a consequence of the major developments occurred in instrument resolution, powder pattern indexing and Fitting techniques, e.g. the problem of peak overlap resulting from the collapse of the three dimensional pattern into one dimensional powder diffraction data has been circumvented by the advent of the Rietveld method. A structure analysis starting from scratch involves successive stages from the collection of high quality powder diffraction
APA, Harvard, Vancouver, ISO, and other styles
46

Hay, Ian, and George Booker. "Teachers’ Perceptions and Classroom Application of Mathematical Computer Software." Journal of Cognitive Education and Psychology 6, no. 1 (January 2006): 61–71. http://dx.doi.org/10.1891/194589506787382350.

Full text
Abstract:
Mathematics teachers from elementary and secondary school settings reported that the main advantage of instructional software pertained to enhancing students’ motivation and educational experiences, whereas the main disadvantage pertained to the poor content and sequencing of much of the available software. Teachers typically used software as a supplemental activity but wanted more programs that encouraged students’ cognitive reasoning, problem-solving and higher-order thinking skills in mathematics. These findings support the notion that although use of computer software has the potential to
APA, Harvard, Vancouver, ISO, and other styles
47

Kanika, Shampa Chakraverty, and Pinaki Chakraborty. "Tools and Techniques for Teaching Computer Programming: A Review." Journal of Educational Technology Systems 49, no. 2 (May 27, 2020): 170–98. http://dx.doi.org/10.1177/0047239520926971.

Full text
Abstract:
Courses on computer programming are included in the curricula of almost all engineering disciplines. We surveyed the research literature and identified the techniques that are commonly used by instructors for teaching these courses. We observed that visual programming and game-based learning can enhance computational thinking and problem-solving skills in students and may be used to introduce them to programming. Robot programming may be used to attract students to programming, but the success of this technique is subjected to the availability of robots. Pair and collaborative programming allo
APA, Harvard, Vancouver, ISO, and other styles
48

PELÁEZ, IGNACIO, FRANCISCO ALMEIDA, and DANIEL GONZÁLEZ. "HIGH LEVEL PARALLEL SKELETONS FOR DYNAMIC PROGRAMMING." Parallel Processing Letters 18, no. 01 (March 2008): 133–47. http://dx.doi.org/10.1142/s0129626408003272.

Full text
Abstract:
Dynamic Programming is an important problem-solving technique used for solving a wide variety of optimization problems. Dynamic Programming programs are commonly designed as individual applications and software tools are usually tailored to specific classes of recurrences and methodologies. That contrasts with some other algorithmic techniques where a single generic program may solve all the instances. We have developed a general skeleton tool providing support for a wide range of dynamic programming methodologies on different parallel architectures. Genericity, flexibility and efficiency are
APA, Harvard, Vancouver, ISO, and other styles
49

Smith, Mike U. "Comment on “identification of student misconceptions in genetics problem solving via computer program”." Journal of Research in Science Teaching 28, no. 4 (April 1991): 383–84. http://dx.doi.org/10.1002/tea.3660280410.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Qiu, Yongjian, Yuming Zhu, and Jingben Yin. "Branch-and-Reduction Algorithm for Indefinite Quadratic Programming Problem." Complexity 2021 (March 30, 2021): 1–14. http://dx.doi.org/10.1155/2021/5578427.

Full text
Abstract:
This paper presents a rectangular branch-and-reduction algorithm for globally solving indefinite quadratic programming problem (IQPP), which has a wide application in engineering design and optimization. In this algorithm, first of all, we convert the IQPP into an equivalent bilinear optimization problem (EBOP). Next, a novel linearizing technique is presented for deriving the linear relaxation programs problem (LRPP) of the EBOP, which can be used to obtain the lower bound of the global optimal value to the EBOP. To obtain a global optimal solution of the EBOP, the main computational task of
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!