Relevant bibliographies by topics / SOLVER program

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "SOLVER program"

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
More sources

Dissertations / Theses on the topic "SOLVER program"

1

Stewart, Charles. "Automated Selected of Mixed Integer Program Solver Parameters." VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/2137.

Full text
Abstract:
This paper presents a method that uses designed experiments and statistical models to extract information about how solver parameter settings perform for classes of mixed integer programs. The use of experimental design facilitates fitting a model that describes the response surface across all combinations of parameter settings, even those not explicitly tested, allowing identification of both desirable and poor settings. Identifying parameter settings that give the best expected performance for a specific class of instances and a specific solver can be used to more efficiently solve a large s
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Lei Ph D. Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. "A fast 3D full-wave solver for nanophotonics." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/39327.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2007.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Includes bibliographical references (p. 57-61).<br>Conventional fast integral equation solvers seem to be ideal approaches for simulating 3-D nanophotonic devices, as these devices are considered to be open structures, generating fields in both an interior channel and in the infinite exterior domain. However, many devices of interest, s
APA, Harvard, Vancouver, ISO, and other styles
3

Bozic, Vladan. "Three-stage Hermite-Birkhoff-Taylor ODE solver with a C++ program." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27751.

Full text
Abstract:
One-step 3-stage Hermite-Birkhoff-Taylor methods, denoted by HBT( p)3, are constructed for solving nonstiff systems of first-order differential equations of the form y' = f( x, y), y(x0) = y0. The method uses derivatives y' to y(p--2) as in Taylor methods and is combined with a 3-stage Runge-Kutta method of order 3. Forcing a Taylor expansion of the numerical solution to agree with an expansion of the true solution leads to Taylor- and Runge-Kutta-type order conditions, which are then reorganized into Vandermonde-type linear systems whose solutions are the coefficients of the method. The ne
APA, Harvard, Vancouver, ISO, and other styles
4

Yano, Masayuki Ph D. Massachusetts Institute of Technology. "Massively parallel solver for the high-order Galerkin Least-Squares method." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54217.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student submitted PDF version of thesis.<br>Includes bibliographical references (p. 85-91).<br>A high-order Galerkin Least-Squares (GLS) finite element discretization is combined with massively parallel implicit solvers. The stabilization parameter of the GLS discretization is modified to improve the resolution characteri
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Yi. "Variable-step variable-order 3-stage Hermite-Birkhoff ODE solver of order 5 to 15 with a C++ program." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/28001.

Full text
Abstract:
Variable-step variable-order 3-stage Hermite-Birkhoff (HB) methods HB( p)3 of order p = 5 to 15 are constructed for solving nonstiff differential equations. Forcing a Taylor expansion of the numerical solution to agree with an expansion of the true solution leads to multistep and Runge-Kutta type order conditions which are reorganized into linear confluent Vandermonde-type systems of HB type. Fast algorithms are developed for solving these systems in O(p2) operations to obtain HB interpolation polynomials in terms of generalized Lagrange basis functions. The order and stepsize of these methods
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Yu. "Variable-step variable-order 3-stage Hermite-Birkhoff-Obrechkoff ODE solver of order 4 to 14 with a C program." Thesis, University of Ottawa (Canada), 2007. http://hdl.handle.net/10393/27500.

Full text
Abstract:
Variable-step variable-order 3-stage Hermite-Birkhoff-Obrechkoff methods of order 4 to 14, denoted by HBO(4-14)3, are constructed for solving nonstiff systems of first-order differential equations of the form y' = f (x, y), y( x0) = y0. These methods use y' and y" as in Obrechkoff's method. Forcing a Taylor expansion of the numerical solution to agree with an expansion of the true solution leads to multistep- and Runge-Kutta-type order conditions which are reorganized into linear Vandermonde-type systems. Fast algorithms are developed for solving these systems to obtain Hermite-Birkhoff inte
APA, Harvard, Vancouver, ISO, and other styles
7

Zhuang, Yuchuan. "Variable-step variable-order 2-stage Hermite-Birkhoff-Obrechkoff ODE solver of order 3 to 14 with a C program." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27746.

Full text
Abstract:
Variable-step variable-order 2-stage Hermite-Birkhoff-Obrechkoff (HBO) methods, HBO(p)2, of order p = 3 to 14, named HBO(3-14)2, are constructed for solving nonstiff first-order differential equations. Forcing an expansion of the numerical solution to agree with a Taylor expansion of the true solution leads to multistep and Runge-Kutta type order conditions which are reorganized into linear Vandermonde-type systems of HBO type. Fast algorithms are developed for solving these systems in O( p2) operations to obtain Hermite-Birkhoff interpolation polynomials in terms of generalized Lagrange basis
APA, Harvard, Vancouver, ISO, and other styles
8

Lu, Zhaosong. "Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7151.

Full text
Abstract:
The limiting behavior of weighted paths associated with the semidefinite program (SDP) map $X^{1/2}SX^{1/2}$ was studied and some applications to error bound analysis and superlinear convergence of a class of primal-dual interior-point methods were provided. A new approach for solving large-scale well-structured sparse SDPs via a saddle point mirror-prox algorithm with ${cal O}(epsilon^{-1})$ efficiency was developed based on exploiting sparsity structure and reformulating SDPs into smooth convex-concave saddle point problems. An iterative solver-based long-step primal-dual infeasible path-fo
APA, Harvard, Vancouver, ISO, and other styles
9

Ferrer, Esteban. "A high order Discontinuous Galerkin - Fourier incompressible 3D Navier-Stokes solver with rotating sliding meshes for simulating cross-flow turbines." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:db8fe6e3-25d0-4f6a-be1b-6cde7832296d.

Full text
Abstract:
This thesis details the development, verification and validation of an unsteady unstructured high order (≥ 3) h/p Discontinuous Galerkin - Fourier solver for the incompressible Navier-Stokes equations on static and rotating meshes in two and three dimensions. This general purpose solver is used to provide insight into cross-flow (wind or tidal) turbine physical phenomena. Simulation of this type of turbine for renewable energy generation needs to account for the rotational motion of the blades with respect to the fixed environment. This rotational motion implies azimuthal changes in blade aero
APA, Harvard, Vancouver, ISO, and other styles
10

Жужгов, А. И., та A. I. Zhuzhgov. "Разработка web-приложения решения задачи оптимизации затрат на перевозку продукции : магистерская диссертация". Master's thesis, б. и, 2021. http://hdl.handle.net/10995/99886.

Full text
Abstract:
Объектом исследования является процесс транспортных перевозок. Предметом исследования выступают пункты потребления и пункты производства, автоматизация системы расчета оптимальной стоимости перевозки. Поставленные задачи: 1. Возможность ввода, корректировки и сохранения вариантов расчёта по оптимизации. 2. Отображение результатов расчета в графическом виде на пользовательской форме. Целью данной работы является создание информационного Web-приложения, который позволит рассчитывать оптимальную стоимость перевозки продукции, предоставлять пользователю результаты расчета в графическом виде. Науч
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "SOLVER program"

1

A, Viterna Larry, and United States. National Aeronautics and Space Administration., eds. ALPS--a linear program solver. NASA, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

A, Viterna Larry, and United States. National Aeronautics and Space Administration., eds. ALPS--a linear program solver. NASA, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

A, Viterna Larry, and United States. National Aeronautics and Space Administration., eds. ALPS--a linear program solver. NASA, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pickering, George. JavaScript how-to: The definitive JavaScript problem-solver. Waite Group Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Thomas, Zane. Visual Basic how-to: Thedefinitive VB3 problem solver. 2nd ed. Waite Group Press, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Holzner, Steven. Visual Basic 6 black book: Indispensable problem solver. Coriolis Technology Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bloom, Stuart. Visual basic 4 databasehow-to: The definitive database problem-solver. Waite Group Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Thomas, Zane. Visual Basic how-to: The definitive VB3 problem solver. 2nd ed. Waite Group Press, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bloom, Stuart. Visual basic 4 database how-to: The definitive database problem-solver. Waite Group Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Honour, Edward. Oracle how-to: The definitive problem-solver for Oracle developers and database administrators. Waite Group Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "SOLVER program"

1

Zambon, Giulio. "The Solver Program." In Sudoku Programming with C. Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-0995-0_3.

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

Van Nieuwenborgh, Davy, Stijn Heymans, and Dirk Vermeir. "An Ordered Logic Program Solver." In Practical Aspects of Declarative Languages. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30557-6_11.

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

Gurfinkel, Arie. "Program Verification with Constrained Horn Clauses (Invited Paper)." In Computer Aided Verification. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13185-1_2.

Full text
Abstract:
AbstractMany problems in program verification, Model Checking, and type inference are naturally expressed as satisfiability of a verification condition expressed in a fragment of First-Order Logic called Constrained Horn Clauses (CHC). This transforms program analysis and verification tasks to the realm of first order satisfiability and into the realm of SMT solvers. In this paper, we give a brief overview of how CHCs capture verification problems for sequential imperative programs, and discuss CHC solving algorithm underlying the Spacer engine of SMT-solver Z3.
APA, Harvard, Vancouver, ISO, and other styles
4

Marple, Kyle, and Gopal Gupta. "Galliwasp: A Goal-Directed Answer Set Solver." In Logic-Based Program Synthesis and Transformation. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38197-3_9.

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

Lozov, Peter, Dmitry Kosarev, Dmitry Ivanov, and Dmitry Boulytchev. "Relational Solver for Java Generics Type System." In Logic-Based Program Synthesis and Transformation. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-45784-5_8.

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

Zhang, Ye, and Flemming Nielson. "A Scalable Inclusion Constraint Solver Using Unification." In Logic-Based Program Synthesis and Transformation. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78769-3_9.

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

Mues, Malte, and Falk Howar. "JDart: Dynamic Symbolic Execution for Java Bytecode (Competition Contribution)." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45237-7_28.

Full text
Abstract:
Abstract JDart performs dynamic symbolic execution of Java programs: it executes programs with concrete inputs while recording symbolic constraints on executed program paths. A constraint solver is then used for generating new concrete values from recorded constraints that drive execution along previously unexplored paths. JDart is built on top of the Java PathFinder software model checker and uses the JConstraints library for the integration of constraint solvers.
APA, Harvard, Vancouver, ISO, and other styles
8

You, Shu-Hung, Robert Bruce Findler, and Christos Dimoulas. "Sound and Complete Concolic Testing for Higher-order Functions." In Programming Languages and Systems. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_23.

Full text
Abstract:
AbstractHigher-order functions have become a staple of modern programming languages. However, such values stymie concolic testers, as the SMT solvers at their hearts are inherently first-order.This paper lays a formal foundations for concolic testing higher-order functional programs. Three ideas enable our results: (i) our tester considers only program inputs in a canonical form; (ii) it collects novel constraints from the evaluation of the canonical inputs to search the space of inputs with partial help from an SMT solver and (iii) it collects constraints from canonical inputs even when they
APA, Harvard, Vancouver, ISO, and other styles
9

Abdennadher, Slim, and Christophe Rigotti. "Constraint Solver Synthesis Using Tabled Resolution for Constraint Logic Programming." In Logic Based Program Synthesis and Transformation. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45013-0_3.

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

Gopinathan, Kiran, Dionysios Spiliopoulos, Vikram Goyal, Peter Müller, Markus Püschel, and Ilya Sergey. "Accelerating Automated Program Verifiers by Automatic Proof Localization." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-98682-6_9.

Full text
Abstract:
Abstract Automated program verifiers such as Dafny, F $$^{\star }$$ ⋆ , Verus, and Viper are now routinely used to verify real-world software. Unfortunately, the performance of the SMT solvers employed by these tools is not always able to keep up with the increasing size and complexity of verification problems, resulting in long verification times and verification failures due to time-outs. This performance degradation occurs because large SMT queries increase the search space for the SMT solver, in particular, the number of possible quantifier instantiations. Most existing attempts to mitigat
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "SOLVER program"

1

Liu, Shaojie, Tengji Xu, Benshan Wang, Dongliang Wang, Qiarong Xiao, and Chaoran Huang. "Scalable and Calibration-Free Microring Circuits Programming with Over 9-Bit Precision." In Optical Fiber Communication Conference. Optica Publishing Group, 2025. https://doi.org/10.1364/ofc.2025.w3d.2.

Full text
Abstract:
We propose a method to program large-scale MRR circuits with minimum calibration. We experimentally achieve over 9-bit precision on a large-scale MRR array and demonstrate a photonic eigenvector and eigenvalue solver with errors of 10−4.
APA, Harvard, Vancouver, ISO, and other styles
2

Bichler, Manuel, Michael Morak, and Stefan Woltran. "Single-Shot Epistemic Logic Program Solving." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/237.

Full text
Abstract:
Epistemic 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 large, non
APA, Harvard, Vancouver, ISO, and other styles
3

Zhang, Linbin, James W. Rector, and G. Mike Hoversten. "Eikonal solver in the celerity domain." In SEG Technical Program Expanded Abstracts 2002. Society of Exploration Geophysicists, 2002. http://dx.doi.org/10.1190/1.1817096.

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

Zhan, Qiwei, Mingwei Zhuang, Qingtao Sun, Qing Huo Liu, and Qiang Ren. "Domain decomposition: 3D full-anisotropy coupling solver." In SEG Technical Program Expanded Abstracts 2017. Society of Exploration Geophysicists, 2017. http://dx.doi.org/10.1190/segam2017-17794395.1.

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

Zhang, Linbin, James W. Rector, and G. Mike Hoversten. "An eikonal solver in tilted TI media." In SEG Technical Program Expanded Abstracts 2002. Society of Exploration Geophysicists, 2002. http://dx.doi.org/10.1190/1.1817077.

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

Sun, Yalei, and Sergey Fomel. "Fast‐marching eikonal solver in the tetragonal coordinates." In SEG Technical Program Expanded Abstracts 1998. Society of Exploration Geophysicists, 1998. http://dx.doi.org/10.1190/1.1820321.

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

Ettrich, Norman. "FD Eikonal solver for 3‐D anisotropic media." In SEG Technical Program Expanded Abstracts 1998. Society of Exploration Geophysicists, 1998. http://dx.doi.org/10.1190/1.1820323.

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

Tavakoli F., B., A. Ribodetti, J. Virieux, and S. Operto. "An iterative factored eikonal solver for TTI media." In SEG Technical Program Expanded Abstracts 2015. Society of Exploration Geophysicists, 2015. http://dx.doi.org/10.1190/segam2015-5863984.1.

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

Dellinger, Joe, and William Symes. "Anisotropic finite‐difference traveltimes using a Hamilton‐Jacobi solver." In SEG Technical Program Expanded Abstracts 1997. Society of Exploration Geophysicists, 1997. http://dx.doi.org/10.1190/1.1885780.

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

Fu*, Shubin, and Kai Gao. "Fast solver for Helmholtz equation using multiscale basis functions." In SEG Technical Program Expanded Abstracts 2015. Society of Exploration Geophysicists, 2015. http://dx.doi.org/10.1190/segam2015-5840170.1.

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

Reports on the topic "SOLVER program"

1

McNamara, B. K., B. M. Rapko, and G. J. Lumetta. The SX Solver: A New Computer Program for Analyzing Solvent-Extraction Equilibria. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/3478.

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

Lumetta, Gregg J., Bruce K. McNamara, and Brian M. Rapko. The SX Solver: A New Computer Program for Analyzing Solvent-Extraction Equilibria. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/781851.

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

Lumetta, Gregg J. The SX Solver: A Computer Program for Analyzing Solvent-Extraction Equilibria: Version 3.0. Office of Scientific and Technical Information (OSTI), 2002. http://dx.doi.org/10.2172/15001169.

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

Chen, Qun, and Michael C. Ferris. FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Program Solver. Defense Technical Information Center, 1999. http://dx.doi.org/10.21236/ada375528.

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

Todd, Jessica, Marie Moland Gaarder, and Amanda Glassman. Demand-Side Incentives for Better Health for the Poor: Conditional Cash Transfer Programs in Latin America and the Caribbean. Inter-American Development Bank, 2006. http://dx.doi.org/10.18235/0008753.

Full text
Abstract:
Conditional Cash Transfer (CCT) programs are spreading rapidly throughout the developing world. These are the subjects of this paper and include Colombia's Familias en Acción, Honduras' PRAF, Jamaica's PATH, Mexico's Progresa/Oportunidades, and Nicaragua's Red de Protección Social. While evaluation results are encouraging, features of program design are remarkably similar country to country, generating concerns that local realities are not sufficiently taken into account and highlighting the need for better ex ante analysis of the underlying development problem to be solved by the intervention
APA, Harvard, Vancouver, ISO, and other styles
6

Ardanaz, Martín, Susana Otálvaro-Ramírez, and Carlos Scartascini. Does Citizen Participation in Budget Allocation Pay? A Survey Experiment on Political Trust and Participatory Governance. Inter-American Development Bank, 2022. http://dx.doi.org/10.18235/0004008.

Full text
Abstract:
Participatory programs can reduce the informational and power asymmetries that engender mistrust. These programs, however, cannot include every citizen. Hence, it is important to evaluate not only if they affect allocations and trust among those who participate, but also if they could also affect trust among those who do not participate. We assess the effect of an informational campaign about these programs in the context of a survey experiment conducted in the city of Buenos Aires, Argentina. Results show that providing detailed information about a participatory budget initiative shapes voter
APA, Harvard, Vancouver, ISO, and other styles
7

Murphy, Pamela, ed. IEA SHC Annual Report 2019. IEA SHC, 2020. http://dx.doi.org/10.18777/ieashc-ar-2020-0001.

Full text
Abstract:
In 2018, the IEA SHC Technology Collaboration Programme (TCP) members used the year to plan for the future, to reflect on past accomplishments, and to transition to a new Executive Committee Chair. All of which supported our underlying pursuit to be the leading and influencing international collaborative research program that produces high quality data and research on solar heating and cooling.
APA, Harvard, Vancouver, ISO, and other styles
8

Kief, Craig J. Solar Structures Program. Defense Technical Information Center, 2015. http://dx.doi.org/10.21236/ada619822.

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

Shpinev, Iu S. ACTUAL PROBLEMS OF THE IMPLEMENTATION OF REGIONAL PROGRAMS FOR THE REPAIR OF APARTMENT BUILDINGS. DOI CODE, 2020. http://dx.doi.org/10.18411/1311-1972-2020-00023.

Full text
Abstract:
In this article, the author analyzes the implementation of regional programs for major repairs of the common property of apartment buildings, taking into account the need to solve the problems of modernization of the housing stock, including improving its energy efficiency.
APA, Harvard, Vancouver, ISO, and other styles
10

Author, Not Given. Solar buildings program summary. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/7078766.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'SOLVER program' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography