Log in

Relevant bibliographies by topics / SOLVER program / Journal articles

To see the other types of publications on this topic, follow the link: SOLVER program.

Journal articles on the topic 'SOLVER program'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

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 'SOLVER program.'

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

Li, Yixuan, Lewis Frampton, Federico Mora, and Elizabeth Polgreen. "Online Prompt Selection for Program Synthesis." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 11 (2025): 11282–89. https://doi.org/10.1609/aaai.v39i11.33227.

Full text

Abstract:

Large Language Models (LLMs) demonstrate impressive capabilities in the domain of program synthesis. This level of performance is not, however, universal across all tasks, all LLMs and all prompting styles. There are many areas where one LLM dominates, one prompting style dominates, or where calling a symbolic solver is a better choice than an LLM. A key challenge for the user then, is to identify not only when an LLM is the right choice of solver, and the appropriate LLM to call for a given synthesis task, but also the right way to call it. A non-expert user who makes the wrong choice, incurs

APA, Harvard, Vancouver, ISO, and other styles

2

ALVIANO, MARIO, CARMINE DODARO, JOHANNES K. FICHTE, MARKUS HECHER, TOBIAS PHILIPP, and JAKOB RATH. "Inconsistency Proofs for ASP: The ASP - DRUPE Format." Theory and Practice of Logic Programming 19, no. 5-6 (2019): 891–907. http://dx.doi.org/10.1017/s1471068419000255.

Full text

Abstract:

AbstractAnswer Set Programming (ASP) solvers are highly-tuned and complex procedures that implicitly solve the consistency problem, i.e., deciding whether a logic program admits an answer set. Verifying whether a claimed answer set is formally a correct answer set of the program can be decided in polynomial time for (normal) programs. However, it is far from immediate to verify whether a program that is claimed to be inconsistent, indeed does not admit any answer sets. In this paper, we address this problem and develop the new proof format ASP-DRUPE for propositional, disjunctive logic program

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Chenglin, and Fangzhen Lin. "Solving Conditional Linear Recurrences for Program Verification: The Periodic Case." Proceedings of the ACM on Programming Languages 7, OOPSLA1 (2023): 28–55. http://dx.doi.org/10.1145/3586028.

Full text

Abstract:

In program verification, one method for reasoning about loops is to convert them into sets of recurrences, and then try to solve these recurrences by computing their closed-form solutions. While there are solvers for computing closed-form solutions to these recurrences, their capabilities are limited when the recurrences have conditional expressions, which arise when the body of a loop contains conditional statements. In this paper, we take a step towards solving these recurrences. Specifically, we consider what we call conditional linear recurrences and show that given such a recurrence and a

APA, Harvard, Vancouver, ISO, and other styles

4

Cabalar, Pedro, Jorge Fandinno, Javier Garea, Javier Romero, and Torsten Schaub. "eclingo : A Solver for Epistemic Logic Programs." Theory and Practice of Logic Programming 20, no. 6 (2020): 834–47. http://dx.doi.org/10.1017/s1471068420000228.

Full text

Abstract:

AbstractWe describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect t

APA, Harvard, Vancouver, ISO, and other styles

5

Shen, Wensheng, Changjiang Zhang, Jun Zhang, and Xiaoqian Ma. "Newton Method for Nonlinear Dynamic Systems with Adaptive Time Stepping." JUCS - Journal of Universal Computer Science 16, no. (6) (2010): 891–902. https://doi.org/10.3217/jucs-016-06-0891.

Full text

Abstract:

This paper presents a nonlinear solver based on the Newton-Krylov methods, where the Newton equations are solved by Krylov-subspace type approaches. We focus on the solution of unsteady systems, in which the temporal terms are discretized by the backward Euler method using finite difference. To save computational cost, an adaptive time stepping is used to minimize the number of time steps. The developed program can be applied to solve any nonlinear equations, provided the users could supply the discrete form of the equations. In particular, the nonlinear solver is implemented to solve unsteady

APA, Harvard, Vancouver, ISO, and other styles

6

Popov, R., and N. Karpenko. "AUTOMATIC SOLVING OF PHYSICS WORD PROBLEMS." Automation of technological and business processes 16, no. 2 (2024): 87–96. http://dx.doi.org/10.15673/atbp.v16i2.2853.

Full text

Abstract:

We present a system that solves simple physics word problems (PWPs) stated in the English language. The main feature of the system is that it is deterministic and yields a correct solution based on real physics formulas. The program generates the solution in a tabular form, showing givens, unknowns, and solution steps. We performed a thorough analysis on the previous work in this field. Most of the research was accumulated in math word problem (MWP) solvers. We have found that these programs are not capable of solving problems from Ukrainian physics textbooks. We identified several types of ph

APA, Harvard, Vancouver, ISO, and other styles

7

BICHLER, MANUEL, MICHAEL MORAK, and STEFAN WOLTRAN. "selp: A Single-Shot Epistemic Logic Program Solver." Theory and Practice of Logic Programming 20, no. 4 (2020): 435–55. http://dx.doi.org/10.1017/s1471068420000022.

Full text

Abstract:

AbstractEpistemic logic programs (ELPs) are an extension of answer set programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. Existing ELP solving approaches generally rely on making multiple calls to an ASP solver in order to evaluate the ELP. However, in this paper, we show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. The resulting ASP program can thus be solved in a single shot. We then implement this encoding method, using recently proposed techniques to handle la

APA, Harvard, Vancouver, ISO, and other styles

8

Zhu, Tinghan. "Evaluating satisfiability modulo theorem solvers for code deobfuscation." Theoretical and Natural Science 51, no. 1 (2024): 91–96. http://dx.doi.org/10.54254/2753-8818/51/2024ch0178.

Full text

Abstract:

Abstract. Automated static program analysis is crucial in cybersecurity research and malware identification. With antivirus software (like Microsoft Windows Defender) employing malware detection algorithms that statically analyze programs that the users interact with, the performance and efficiency of automatic static program analysis becomes more important than ever. Code obfuscation is a tactic of complicating the program expression and logic without affecting its semantics to prevent reverse engineering. The prevalence of code obfuscation makes static program analysis difficult. Symbolic ex

APA, Harvard, Vancouver, ISO, and other styles

9

DUCK, GREGORY J., JOXAN JAFFAR, and ROLAND H. C. YAP. "Shape Neutral Analysis of Graph-based Data-structures." Theory and Practice of Logic Programming 18, no. 3-4 (2018): 470–83. http://dx.doi.org/10.1017/s147106841800025x.

Full text

Abstract:

AbstractMalformed data-structures can lead to runtime errors such as arbitrary memory access or corruption. Despite this, reasoning over data-structure properties for low-level heap manipulating programs remains challenging. In this paper we present a constraint-based program analysis that checks data-structure integrity, w.r.t. given target data-structure properties, as the heap is manipulated by the program. Our approach is to automatically generate a solver for properties using the type definitions from the target program. The generated solver is implemented using a Constraint Handling Rule

APA, Harvard, Vancouver, ISO, and other styles

10

L. Kaizer, Wesley, André G. Pereira, and Marcus Ritt. "Sequencing Operator Counts with State-Space Search." Proceedings of the International Conference on Automated Planning and Scheduling 30 (June 1, 2020): 166–74. http://dx.doi.org/10.1609/icaps.v30i1.6658.

Full text

Abstract:

A search algorithm with an admissible heuristic function is the most common approach to optimally solve classical planning tasks. Recently Daviesetal.(2015) introduced the solver OpSeq using Logic-Based Benders Decomposition to solve planning tasks optimally. In this approach, the master problem is an integer program derived from the operator-counting framework that generates operator counts, i.e., an assignment of integer counts for each task operator. Then, the operator counts sequencing subproblem verifies if a plan satisfying these operator counts exists, or generates a necessary violated

APA, Harvard, Vancouver, ISO, and other styles

11

Chen, Jianhui, and Fei He. "Leveraging Control Flow Knowledge in SMT Solving of Program Verification." ACM Transactions on Software Engineering and Methodology 30, no. 4 (2021): 1–26. http://dx.doi.org/10.1145/3446211.

Full text

Abstract:

Satisfiability modulo theories (SMT) solvers have been widely applied as the reasoning engine for diverse software analysis and verification technologies. The efficiency of the SMT solver has significant effects on the performance of these technologies. However, current SMT solvers are designed for the general purpose of constraint solving. Lots of useful knowledge of programs cannot be utilized during SMT solving. As a result, the SMT solver may spend much effort to explore redundant search space. In this article, we propose a novel approach to utilizing control-flow knowledge in SMT solving.

APA, Harvard, Vancouver, ISO, and other styles

12

Ge, Li, Wei Liu, and Jianqiang Shan. "Development and Application of a New High-Efficiency Sparse Linear System Solver in the Thermal-Hydraulic System Analysis Code." Science and Technology of Nuclear Installations 2017 (2017): 1–10. http://dx.doi.org/10.1155/2017/7072197.

Full text

Abstract:

This paper presents a faster solver named NRLU (Node Reordering Lower Upper) factorization solver to improve the solution speed for the pressure equations, which are formed by RELAP5/MOD3.3. The NRLU solver uses the oriented graph method and minimal fill-ins rule to reorder the structure of the nonsymmetry sparse pressure matrix. It solves the pressure matrix by LU factorization. Then the solver is embedded into the large scale advanced thermal-hydraulic system analysis program RELAP5/MOD3.3. The comparisons of the original solver and the NRLU solver show that the NRLU solver is faster than th

APA, Harvard, Vancouver, ISO, and other styles

13

Azeez, Halgurd N., and Abdulqader O. Ameen. "SOLVING STOCHASTIC TRANSPORTATION ELECTRICITY PROBLEM WITH FUZZY INFORMATION ON PROBABILITY DISTRIBUTION USING MATLAB PROGRAM." Science Journal of University of Zakho 12, no. 1 (2024): 116–37. http://dx.doi.org/10.25271/sjuoz.2024.12.1.1212.

Full text

Abstract:

This study focuses on MATLAB code programs of the entire stages of solving Stochastic Transportation Linear Programming Problems with Fuzzy Uncertainty Information on Probability Distribution Space (STLPPFI) with its algorithm outlines. A MATLAB code program of STLPPFI problem solver with algorithm outlines are proposed to solve STLPPFI model problems, and it utilizes many concepts as Alpha-Cut technique, Truth Degrees technique, Linear Fuzzy Membership Function (LFMF), Trapezoidal Fuzzy Number , Triangular Fuzzy Number , Linear Fuzzy Ranking Function (LFRF), Expectation Weighted Summation tec

APA, Harvard, Vancouver, ISO, and other styles

14

Phipps-Costin, Luna, Carolyn Jane Anderson, Michael Greenberg, and Arjun Guha. "Solver-based gradual type migration." Proceedings of the ACM on Programming Languages 5, OOPSLA (2021): 1–27. http://dx.doi.org/10.1145/3485488.

Full text

Abstract:

Gradually typed languages allow programmers to mix statically and dynamically typed code, enabling them to incrementally reap the benefits of static typing as they add type annotations to their code. However, this type migration process is typically a manual effort with limited tool support. This paper examines the problem of automated type migration: given a dynamic program, infer additional or improved type annotations. Existing type migration algorithms prioritize different goals, such as maximizing type precision, maintaining compatibility with unmigrated code, and preserving the semantics

APA, Harvard, Vancouver, ISO, and other styles

15

Bembenek, Aaron, Michael Greenberg, and Stephen Chong. "From SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Selection Problems." Proceedings of the ACM on Programming Languages 7, POPL (2023): 185–217. http://dx.doi.org/10.1145/3571200.

Full text

Abstract:

Given a set of candidate Datalog rules, the Datalog synthesis-as-rule-selection problem chooses a subset of these rules that satisfies a specification (such as an input-output example). Building off prior work using counterexample-guided inductive synthesis, we present a progression of three solver-based approaches for solving Datalog synthesis-as-rule-selection problems. Two of our approaches offer some advantages over existing approaches, and can be used more generally to solve arbitrary SMT formulas containing Datalog predicates; the third—an encoding into standard, off-the-shelf answer set

APA, Harvard, Vancouver, ISO, and other styles

16

Unno, Hiroshi, Takeshi Tsukada, and Jie-Hong Roland Jiang. "Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 11 (2025): 11372–80. https://doi.org/10.1609/aaai.v39i11.33237.

Full text

Abstract:

The satisfiability (SAT) problem of higher-order quantified Boolean formula (HOQBF) emerged as a natural generalization of SAT, quantified SAT, and second-order quantified SAT. It allows succinct encoding of k-EXPTIME problems beyond the reach of prior Boolean satisfiability formulations, but its application was hampered by the lack of solvers. In this paper, we present the first HOQBF solver that leverages techniques from the model-checking community. Our HOQBF solver is based on reduction to higher-order model checking, which is a generalization from model checking of while-programs to that

APA, Harvard, Vancouver, ISO, and other styles

17

Jacobs, Bart. "The VeriFast program verifier and its SMT solver interaction." Electronic Proceedings in Theoretical Computer Science 186 (July 30, 2015): 2. http://dx.doi.org/10.4204/eptcs.186.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Biao, Wu, and Qi-Wei Ge. "Test Input Data Generation for Choiceless Program Nets." ECTI Transactions on Computer and Information Technology (ECTI-CIT) 14, no. 1 (2020): 37–45. http://dx.doi.org/10.37936/ecti-cit.2020141.197859.

Full text

Abstract:

Software testing is an important problem in designing a large software system and this problem is difficult to be solved due to its computational complexity. We try to use program nets to approach this problem and have proposed algorithms to divide a whole program net into subnets that can structurally cover the original one based on divide-and-conquer method. This paper aims to solve the remaining task of our approach, that is how to find test input data for each subnet to be called choiceless program net. Firstly, definitions of program nets are extended and the properties of choiceless prog

APA, Harvard, Vancouver, ISO, and other styles

19

Fandinno, Jorge, and Lute Lillo. "Solving Epistemic Logic Programs Using Generate-and-Test with Propagation." Proceedings of the AAAI Conference on Artificial Intelligence 39, no. 14 (2025): 14902–10. https://doi.org/10.1609/aaai.v39i14.33634.

Full text

Abstract:

This paper introduces a general framework for generate-and-test-based solvers for epistemic logic programs that can be instantiated with different generate and test programs, and it provides sufficient conditions on those programs for the correctness of the solvers built using this framework. It also introduces a new generator program that incorporates the propagation of epistemic consequences and shows that this can exponentially reduce the number of candidates that need to be tested while only incurring a linear overhead. We implement a new solver based on these theoretical findings and expe

APA, Harvard, Vancouver, ISO, and other styles

20

David, Cristina, and Daniel Kroening. "Program synthesis: challenges and opportunities." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 375, no. 2104 (2017): 20150403. http://dx.doi.org/10.1098/rsta.2015.0403.

Full text

Abstract:

Program synthesis is the mechanized construction of software, dubbed ‘self-writing code’. Synthesis tools relieve the programmer from thinking about how the problem is to be solved; instead, the programmer only provides a description of what is to be achieved. Given a specification of what the program should do, the synthesizer generates an implementation that provably satisfies this specification. From a logical point of view, a program synthesizer is a solver for second-order existential logic. Owing to the expressiveness of second-order logic, program synthesis has an extremely broad range

APA, Harvard, Vancouver, ISO, and other styles

21

ALVIANO, MARIO, and RAFAEL PEÑALOZA. "Fuzzy answer sets approximations." Theory and Practice of Logic Programming 13, no. 4-5 (2013): 753–67. http://dx.doi.org/10.1017/s1471068413000471.

Full text

Abstract:

AbstractFuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answer sets can be introduced: Given

APA, Harvard, Vancouver, ISO, and other styles

22

Kahl, Patrick, Richard Watson, Evgenii Balai, Michael Gelfond, and Yuanlin Zhang. "The language of epistemic specifications (refined) including a prototype solver." Journal of Logic and Computation 30, no. 4 (2015): 953–89. http://dx.doi.org/10.1093/logcom/exv065.

Full text

Abstract:

Abstract In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing solutions of programs written in this new version of the language. The new semantics is illustrated by a number of examples, including an Epistemic Specifications-based framework for conformant planning. In addition, we introduce the notion of an epistemic logic program with sorts . This extends recent efforts to define a logic programming language that includes the means fo

APA, Harvard, Vancouver, ISO, and other styles

23

Xie, Dexuan, Yi Jiang, and Jinyong Ying. "A Poisson-Boltzmann Equation Test Model for Protein in Spherical Solute Region and its Applications." Computational and Mathematical Biophysics 2, no. 1 (2014): 86–97. http://dx.doi.org/10.2478/mlbmb-2014-0006.

Full text

Abstract:

Abstract The Poisson-Boltzmann equation (PBE) is one important implicit solvent continuum model for calculating electrostatics of protein in ionic solvent. Several numerical algorithms and program packages have been developed but verification and comparison between them remains an interesting topic. In this paper, a PBE test model is presented for a protein in a spherical solute region, along with its analytical solution. It is then used to verify a PBE finite element solver and applied to a numerical comparison study between a finite element solver and a finite difference solver. Such a study

APA, Harvard, Vancouver, ISO, and other styles

24

Sledge, Frank R., and Werner C. Rheinboldt. "A program design for an adaptive, nonlinear finite element solver." Computers & Structures 20, no. 1-3 (1985): 85–90. http://dx.doi.org/10.1016/0045-7949(85)90056-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Löhne, Andreas, and Benjamin Weißing. "The vector linear program solver Bensolve – notes on theoretical background." European Journal of Operational Research 260, no. 3 (2017): 807–13. http://dx.doi.org/10.1016/j.ejor.2016.02.039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

WANG, NING, and HAO ZHONG WANG. "A HAMILTON SOLVER FOR FINDING MODAL EIGENVALUES." Journal of Computational Acoustics 18, no. 03 (2010): 259–66. http://dx.doi.org/10.1142/s0218396x10004164.

Full text

Abstract:

A method is proposed for finding the normal mode eigenvalues in shallow water waveguide. We transform the problem determining eigenvalues in complex wave number plane into solving a "true" one dimensional Hamilton system. Simulations are performed, the result agrees very well with that calculated by the normal mode program KrakanC.

APA, Harvard, Vancouver, ISO, and other styles

27

GRZYBOWSKI, Michał, Jakub MŁYŃCZAK, Piotr FOLĘGA, Lucyna SOKOŁOWSKA, and Daniel PIETRUSZCZAK. "DETECTION OF LADDER PROGRAM UNSTABLE STATES." Transport Problems 19, no. 3 (2024): 107–19. https://doi.org/10.20858/tp.2023.19.3.09.

Full text

Abstract:

This paper presents a modern method of detecting unstable states in ladder programs. Ladder programs are standard formalism used in a wide range of automation applications, especially in railway signaling systems. This formalism is characterized by a lack of explicit program control flow, which can result in the presence of unstable states. A state is unstable, if it leads to cyclic state transitions not anticipated by the designer (loop). The presence of unstable states is one of the possible program defects. This kind of defect is hard to detect and can harm program reliability. The presence

APA, Harvard, Vancouver, ISO, and other styles

28

Kropf, Peter G., Edgar F. A. Lederer, Thomas Steffen, Karl Guggisberg, Jean-Guy Schneider, and Peter Schwab. "SPINET: A Parallel Computing Approach to Spine Simulations." Scientific Programming 5, no. 1 (1996): 15–24. http://dx.doi.org/10.1155/1996/607139.

Full text

Abstract:

Research in scientitic programming enables us to realize more and more complex applications, and on the other hand, application-driven demands on computing methods and power are continuously growing. Therefore, interdisciplinary approaches become more widely used. The interdisciplinary SPINET project presented in this article applies modern scientific computing tools to biomechanical simulations: parallel computing and symbolic and modern functional programming. The target application is the human spine. Simulations of the spine help us to investigate and better understand the mechanisms of ba

APA, Harvard, Vancouver, ISO, and other styles

29

Finkelstein, L., and S. Markovitch. "A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle." Journal of Artificial Intelligence Research 8 (June 1, 1998): 223–63. http://dx.doi.org/10.1613/jair.484.

Full text

Abstract:

One of the most common mechanisms used for speeding up problem solvers is macro-learning. Macros are sequences of basic operators acquired during problem solving. Macros are used by the problem solver as if they were basic operators. The major problem that macro-learning presents is the vast number of macros that are available for acquisition. Macros increase the branching factor of the search space and can severely degrade problem-solving efficiency. To make macro learning useful, a program must be selective in acquiring and utilizing macros. This paper describes a general method for selectiv

APA, Harvard, Vancouver, ISO, and other styles

30

Sambaraju, Prasanth. "Use of Worksheet events in Excel to save solver objective cell value from each iteration." Research Ideas and Outcomes 8 (February 25, 2022): e79006. https://doi.org/10.3897/rio.8.e79006.

Full text

Abstract:

Solver is a Microsoft Excel add-in program which is used to find an optimal value for a formula in the objective cell. Solver accomplishes this either by maximizing, minimizing or setting the objective cell value to a specific value. The article presents the utility of in built worksheet events in Excel VBA to save the value of objective cell from each iteration when solver is used for optimization.

APA, Harvard, Vancouver, ISO, and other styles

31

Kabdylkakov, Ye A., A. S. Suraev, and R. A. Irkimbekov. "APPLICATION OF THE TEXT INTERFACE OF THE ANSYS FLUENT PROGRAM FOR SIMULATION OF THE THERMOPHYSICAL STATE OF A TYPICAL EXPERIMENTAL DEVICE." NNC RK Bulletin, no. 3 (September 28, 2022): 55–63. http://dx.doi.org/10.52676/1729-7885-2022-3-55-63.

Full text

Abstract:

The paper is dedicated to development of log of the ANSYS FLUENT program text commands. Although this program has well-developed and easy-to use graphical interface, command logs allow to conduct the configurations of the solver, optimizing the process of calculation justification safety of reactor experiments conducted at the “Institute of Atomic Energy” Branch of the RSE “National Nuclear Center of the Republic of Kazakhstan” (IAE Branch RSE NNC RK). Command logs allows to control the command to save the ANSYS FLUENT program solver as code in a separate file, which can later be used for othe

APA, Harvard, Vancouver, ISO, and other styles

32

Boyle, James M., and Terence J. Harmer. "A practical functional program for the CRAY X-MP." Journal of Functional Programming 2, no. 1 (1992): 81–126. http://dx.doi.org/10.1017/s0956796800000289.

Full text

Abstract:

AbstractOne can have all the advantages of functional programming – correctness, clarity, simplicity, and flexibility – without any sacrifice in performance, even for a scientifically significant computation on a supercomputer. Therefore, why use Fortran? We demonstrate parity – equality of speed and storage use – between a program generated automatically from a functional specification and a program written by hand in the procedural style. To our knowledge, this demonstration of parity is the first for a program that solves a scientifically significant problem – quasi-linear hyperbolic partia

APA, Harvard, Vancouver, ISO, and other styles

33

Yusuf, Risna, and Yayan Hikmayani. "MINIMALISASI BIAYA DISTRIBUSI INDUSTRI PENGOLAHAN PRODUK PERIKANAN: APLIKASI TRANSPORTASI PROGRAM SOLVER." Jurnal Sosial Ekonomi Kelautan dan Perikanan 12, no. 2 (2017): 151. http://dx.doi.org/10.15578/jsekp.v12i2.6480.

Full text

Abstract:

Masalah pendistribusian suatu komoditas atau produk dari sejumlah sumber ke sejumlah tujuan perlu dilakukan agar biaya pengiriman produk seminimal mungkin. Program solver merupakan salah satu software yang banyak digunakan untuk masalah optimasi misalnya dalam menyelesaikan masalah transportasi. Model transportasi berkaitan dengan penentuan rencana biaya terendah untuk mengirimkan satu barang dari sejumlah sumber pasokan ke sejumlah daerah tujuan yang menjadi sentra industri. Tujuan penelitian ini adalah mengkaji penerapan metode transportasi dengan program solver dalam meminimunkan biaya dist

APA, Harvard, Vancouver, ISO, and other styles

34

Pandala, Abhishek Goud, Yanran Ding, and Hae-Won Park. "qpSWIFT: A Real-Time Sparse Quadratic Program Solver for Robotic Applications." IEEE Robotics and Automation Letters 4, no. 4 (2019): 3355–62. http://dx.doi.org/10.1109/lra.2019.2926664.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Kahl, Patrick Thor, Anthony P. Leclerc, and Son Cao Tran. "A parallel memory-efficient epistemic logic program solver: harder, better, faster." Annals of Mathematics and Artificial Intelligence 86, no. 1-3 (2019): 61–85. http://dx.doi.org/10.1007/s10472-019-09621-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

AZZOLINI, DAMIANO, ELISABETTA GENTILI, and FABRIZIO RIGUZZI. "Symbolic Parameter Learning in Probabilistic Answer Set Programming." Theory and Practice of Logic Programming 24, no. 4 (2024): 698–715. https://doi.org/10.1017/s1471068424000334.

Full text

Abstract:

AbstractParameter learning is a crucial task in the field of Statistical Relational Artificial Intelligence: given a probabilistic logic program and a set of observations in the form of interpretations, the goal is to learn the probabilities of the facts in the program such that the probabilities of the interpretations are maximized. In this paper, we propose two algorithms to solve such a task within the formalism of Probabilistic Answer Set Programming, both based on the extraction of symbolic equations representing the probabilities of the interpretations. The first solves the task using an

APA, Harvard, Vancouver, ISO, and other styles

37

Chitalov, Dmitry. "On developing a module for the stressFOAM solver of the OpenFOAM environment." EPJ Web of Conferences 321 (2025): 01008. https://doi.org/10.1051/epjconf/202532101008.

Full text

Abstract:

The present paper summarizes the study results on expanding capabilities of a graphical environment for the OpenFOAM program complex in operation with the stressFOAM solver. The OpenFOAM key disadvantage requiring further study is determined. The author defines urgency of the problem under study, analyzes the available solutions and their weak points. The study purposes and steps for their achievement are stated. The purpose of the stressFOAM solver and its basic application field are described. A stack of technologies to implement a graphical, software component of the application, data stora

APA, Harvard, Vancouver, ISO, and other styles

38

Sina, Ibnu, and Ahmadi. "IMPROVING UNDERSTANDING OF SIMPLEX OPERATIONS THROUGH DEVELOPING THE SIMPLEX SOLVER APPLICATION IN LINEAR PROGRAM COURSES." Integral (Jurnal Penelitian Pendidikan Matematika) 6, no. 1 (2023): 64–78. http://dx.doi.org/10.24905/jppm.v6i1.123.

Full text

Abstract:

Based on the researcher's experience, in Linear Program lectures there is a tendency for students to be less active so that the spirit in the learning process seems to be absent. In solving problems, students tend to follow the completion steps outlined by the lecturer. This may be due to the low ability of students to make mathematical models. One of the factors causing the low ability to make mathematical models is the limited teaching materials according to student abilities. One of the efforts that can be made to increase the ability to make mathematical models in the Linear Program course

APA, Harvard, Vancouver, ISO, and other styles

39

Gustafson, Sven-Åke. "Investigating semi-infinite programs using penalty functions and Lagrangian methods." Journal of the Australian Mathematical Society. Series B. Applied Mathematics 28, no. 2 (1986): 158–69. http://dx.doi.org/10.1017/s0334270000005270.

Full text

Abstract:

AbstractIn this paper the relations between semi-infinite programs and optimisation problems with finitely many variables and constraints are reviewed. Two classes of convex semi-infinite programs are defined, one based on the fact that a convex set may be represented as the intersection of closed halfspaces, while the other class is defined using the representation of the elements of a convex set as convex combinations of points and directions. Extension to nonconvex problems is given. A common technique of solving a semi-infinite program computationally is to derive necessary conditions for

APA, Harvard, Vancouver, ISO, and other styles

40

Halimah, Halimah, Raja Ibnu Pamungkas, and Yanuar Kristi. "Social Entrepreneurship Training for Beneficiary Families in Sundajaya Hilir Village: Pejuang Muda Best Project." Journal of Community Research and Service 6, no. 2 (2022): 210. http://dx.doi.org/10.24114/jcrs.v6i2.35232.

Full text

Abstract:

Pejuang Muda is a program initiated by the Ministry of Social Affairs in collaboration with the Ministry of Education, Culture, Research, and Technology and the Ministry of Religion of the Republic of Indonesia as a welcome form of the Merdeka Learning Campus Merdeka (MBKM) program. The purpose of Pejuang Muda is to carry out learning outside the campus to produce students who have problem solver cycle skills, identify problems, plan programs, and implement programs. The learning was carried out in two parts, namely learning General Materials through online/online and Team Based Projects. Peju

APA, Harvard, Vancouver, ISO, and other styles

41

Cao, Wei, Chuan Fu Xu, and Zheng Hua Wang. "Heterogeneous Computing for a CFD Solver on GPU/CPU Computer." Advanced Materials Research 791-793 (September 2013): 1252–55. http://dx.doi.org/10.4028/www.scientific.net/amr.791-793.1252.

Full text

Abstract:

The high-order schemes have attracted more and more attention in computational fluid dynamics (CFD) simulations. As a kind of high-order schemes, weighted compact nonlinear schemes (WCNSs) have been widely applied. In recent years, the highly parallel graphics processing unit (GPU) is rapidly gaining maturity as a powerful engine for high performance computer. This paper studies the heterogeneous parallel computation and implementation of a high-order CFD program on Tianhe-1A supercomputer system. The CFD program is intended for the solution of the Navier-Stokes equations on multi-block Cartes

APA, Harvard, Vancouver, ISO, and other styles

42

NIJBOER, R. J., and J. P. GOEDBLOED. "Mode coupling in two-dimensional magnetohydrodynamic flows." Journal of Plasma Physics 61, no. 2 (1999): 241–62. http://dx.doi.org/10.1017/s0022377898007430.

Full text

Abstract:

The spectrum of incompressible waves and instabilities of two-dimensional plasma geometries with background flow is calculated. The equilibrium is solved numerically by the recently developed program FLow Equilibrium Solver (FLES). The spectra of the equilibria are computed by means of another new program, the INcompressible 2-dimensional FLow Eigenvalue Solver (IN2FLES). Magnetic instabilities and instabilities driven by the two-dimensionality and the flow are found. For linear equilibria, the eigenvalues for elliptical geometries remain close to the curves on which the eigenvalues for circul

APA, Harvard, Vancouver, ISO, and other styles

43

Atanassov, Atanas. "DEVELOPING SITUATIONAL CONDITIONS AND PROGRAM CODES FOR PARALLEL SITUATIONAL ANALYSIS SOLVER BASED ON CONIC UMBRA/SUNLIT MODELS." Aerospace Research in Bulgaria 36 (2024): 15–28. http://dx.doi.org/10.3897/arb.v36.e02.

Full text

Abstract:

The search for optimal time intervals for satellite operations performance is based on verifying specific conditions of geometric or physical nature. Several conditions are combined in a situational problem. To be able to solve different situational problems, it is necessary to develop program codes for verifying different situational conditions in advance. Two situational conditions for determining if the satellite is in the sunlit zone or the umbra based on the conical models of the earth's shadow are presented. Necessary (but not sufficient) conditions are introduced to locate the satellite

APA, Harvard, Vancouver, ISO, and other styles

44

DE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Predicate Pairing for program verification." Theory and Practice of Logic Programming 18, no. 2 (2017): 126–66. http://dx.doi.org/10.1017/s1471068417000497.

Full text

Abstract:

AbstractIt is well-known that the verification of partial correctness properties of imperative programs can be reduced to the satisfiability problem for constrained Horn clauses (CHCs). However, state-of-the-art solvers for constrained Horn clauses (or CHC solvers) based onpredicate abstractionare sometimes unable to verify satisfiability because they look for models that are definable in a given class 𝓐 of constraints, called 𝓐-definable models. We introduce a transformation technique, calledPredicate Pairing, which is able, in many interesting cases, to transform a set of clauses into an equ

APA, Harvard, Vancouver, ISO, and other styles

45

JANHUNEN, TOMI, and EMILIA OIKARINEN. "Automated Verification of Weak Equivalence within thesmodelsSystem." Theory and Practice of Logic Programming 7, no. 6 (2007): 697–744. http://dx.doi.org/10.1017/s1471068407003031.

Full text

Abstract:

AbstractIn answer set programming (ASP), a problem at hand is solved by (i) writing a logic program whose answer sets correspond to the solutions of the problem, and by (ii) computing the answer sets of the program using ananswer set solveras a search engine. Typically, a programmer creates a series of gradually improving logic programs for a particular problem when optimizing program length and execution time on a particular solver. This leads the programmer to a meta-level problem of ensuring that the programs are equivalent, i.e., they give rise to the same answer sets. To ease answer set p

APA, Harvard, Vancouver, ISO, and other styles

46

Vuckovic, Vladan. "Realization of the chess mate solver application." Yugoslav Journal of Operations Research 14, no. 2 (2004): 273–88. http://dx.doi.org/10.2298/yjor0402273v.

Full text

Abstract:

This paper presents details of the chess mate solver application, which is a part of the author?s Geniss general chess application. The problem chess is an important domain connected with solving of the chess problems. The Geniss Mate Solver (G.M.S.) application solves Mate-in-N-move problems. Main techniques used for the implementation of the application are full-width searching with Alpha-Beta pruning technique and zero evaluation function. The application is written in Delphi for Windows programming environment and the searching engine is completely coded in assembly language (about 10000 l

APA, Harvard, Vancouver, ISO, and other styles

47

Tc, Widiastuti, and Yubali Ani, Ashiong Parhehean Munthe. "Pengembangan Diri Sebagai Fasilitator Belajar Pada Program Education Di Sentul Bogor." Prosiding Konferensi Nasional Pengabdian Kepada Masyarakat dan Corporate Social Responsibility (PKM-CSR) 2 (December 14, 2019): 782–90. http://dx.doi.org/10.37695/pkmcsr.v2i0.307.

Full text

Abstract:

This activity is a continuation of the collaboration that began from the 2018-2019 term I academic year between the Pelita Harapan PGSD-FIP and the Emmanuel Foundation. Activities carried out include; this training is dedicated for learning facilitators to be able to teach creatively and practice their teaching skills at the location of their learning community. The objectives of the training activities are: 1) developing high school students themselves as learning facilitators; 2) lead learners who learn; 3) able to solve problems (problem solver), both for themselves and the environment; 4)

APA, Harvard, Vancouver, ISO, and other styles

48

Hand, Laura C. "Producing a Vision of the Self-Governing Mother: A Study of Street-Level Bureaucrat Behavior in Coproductive Interactions." Administration & Society 50, no. 8 (2017): 1148–74. http://dx.doi.org/10.1177/0095399717719110.

Full text

Abstract:

Street-level bureaucrats in social welfare programs often interact with program participants in coproductive environments where program objectives cannot be achieved without participant behavior change. In these environments, interactions are expected to help produce participant outcomes, a process that has been underexamined. This study investigates interactions and analyzes practices employed by street-level bureaucrats to encourage behavior change among program participants in two clinics in Arizona’s Special Supplemental Nutrition Program for Women, Infants, and Children (WIC). The finding

APA, Harvard, Vancouver, ISO, and other styles

49

Julita, Risna, Mahdhivan Syafwan, and Budi Rudianto. "Metode Jalur Kritis dan Pendekatan Program Linier pada Masalah Manajemen Proyek." Jurnal Matematika UNAND 4, no. 4 (2019): 161. http://dx.doi.org/10.25077/jmu.4.4.161-172.2015.

Full text

Abstract:

Salah satu permasalahan dalam proyek adalah menyelesaikan masalah manajemen proyek secara optimal. Masalah manajemen proyek tersebut dapat diselesaikan dengan menggunakan metode jalur kritis dan pendekatan program linier. Pada metode jalur kritis, penyelesaian masalah manajemen proyek untuk menentukan jalur kritis diidentifikasi dengan mencari variabel slack. Dan pada pendekatan program linier, jalur kritis bisa dicari menggunakan solver program linier pada Microsoft Excel 2010. Dari jalur kritis ini dapat ditentukan durasi penyelesaian proyek pada kondisi normal (tidak ada penundaan pada seti

APA, Harvard, Vancouver, ISO, and other styles

50

Zhang, Qinghong. "The maximal angle between 5×5 positive semidefinite and 5×5 nonnegative matrices." Electronic Journal of Linear Algebra 37 (November 19, 2021): 698–708. http://dx.doi.org/10.13001/ela.2021.6647.

Full text

Abstract:

The paper is devoted to the study of the maximal angle between the $5\times 5$ semidefinite matrix cone and $5\times 5$ nonnegative matrix cone. A signomial geometric programming problem is formulated in the process to find the maximal angle. Instead of using an optimization problem solver to solve the problem numerically, the method of Lagrange Multipliers is used to solve the signomial geometric program, and therefore, to find the maximal angle between these two cones.

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!