Academic literature on the topic 'Guaranteed computations'

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 'Guaranteed computations.'

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 "Guaranteed computations"

1

YANG, ZHONGHUA, CHENGZHENG SUN, YUAN MIAO, ABDUL SATTAR, and YANYAN YANG. "GUARANTEED MUTUALLY CONSISTENT CHECKPOINTING IN DISTRIBUTED COMPUTATIONS." International Journal of Foundations of Computer Science 11, no. 01 (2000): 153–66. http://dx.doi.org/10.1142/s0129054100000089.

Full text
Abstract:
In this paper, we explore the isomorphism between vector time and causality to characterize consistency of a set of checkpoints in a distributed computing. A necessary and sufficient condition, to determine if a set of local checkpoints can form a consistent global checkpoint, is presented and proved using the isomorphic power of vector time and causality. To the best of our knowledge, this is the first attempt to use the isomorphism for this purpose. This condition leads to a simple and straightforward algorithm for a guaranteed mutually consistent global checkpointing. In our approach, a pro
APA, Harvard, Vancouver, ISO, and other styles
2

YONG, XIE, and HSU WEN-JING. "ALIGNED MULTITHREADED COMPUTATIONS AND THEIR SCHEDULING WITH PERFORMANCE GUARANTEES." Parallel Processing Letters 13, no. 03 (2003): 353–64. http://dx.doi.org/10.1142/s0129626403001331.

Full text
Abstract:
This paper considers the problem of scheduling dynamic parallel computations to achieve linear speedup without using significantly more space per processor than that required for a single processor execution. Earlier research in the Cilk project proposed the "strict" computational model, in which every dependency goes from a thread x only to one of x's ancestor threads, and guaranteed both linear speedup and linear expansion of space. However, Cilk threads are stateless, and the task graph that Cilk language expresses is series-parallel graph, which is a proper subset of arbitrary task graph.
APA, Harvard, Vancouver, ISO, and other styles
3

Evstigneev, Nikolay M., and Oleg I. Ryabkov. "Reduction in Degrees of Freedom for Large-Scale Nonlinear Systems in Computer-Assisted Proofs." Mathematics 11, no. 20 (2023): 4336. http://dx.doi.org/10.3390/math11204336.

Full text
Abstract:
In many physical systems, it is important to know the exact trajectory of a solution. Relevant applications include celestial mechanics, fluid mechanics, robotics, etc. For cases where analytical methods cannot be applied, one can use computer-assisted proofs or rigorous computations. One can obtain a guaranteed bound for the solution trajectory in the phase space. The application of rigorous computations poses few problems for low-dimensional systems of ordinary differential equations (ODEs) but is a challenging problem for large-scale systems, for example, systems of ODEs obtained from the d
APA, Harvard, Vancouver, ISO, and other styles
4

Ainsworth, Mark, and Richard Rankin. "Guaranteed computable bounds on quantities of interest in finite element computations." International Journal for Numerical Methods in Engineering 89, no. 13 (2012): 1605–34. http://dx.doi.org/10.1002/nme.3276.

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

Xie, Dawei, Haining Yang, Jing Qin, and Jixin Ma. "Privacy-Preserving and Publicly Verifiable Protocol for Outsourcing Polynomials Evaluation to a Malicious Cloud." International Journal of Digital Crime and Forensics 11, no. 4 (2019): 14–27. http://dx.doi.org/10.4018/ijdcf.2019100102.

Full text
Abstract:
As cloud computing provides affordable and scalable computational resources, delegating heavy computing tasks to the cloud service providers is appealing to individuals and companies. Among different types of specific computations, the polynomial evaluation is an important one due to its wide usage in engineering and scientific fields. Cloud service providers may not be trusted, thus, the validity and the privacy of such computation should be guaranteed. In this article, the authors present a protocol for publicly verifiable delegations of high degree polynomials. Compared with the existing so
APA, Harvard, Vancouver, ISO, and other styles
6

LÊ, DINH, and D. STOTT PARKER. "Using randomization to make recursive matrix algorithms practical." Journal of Functional Programming 9, no. 6 (1999): 605–24. http://dx.doi.org/10.1017/s0956796899003470.

Full text
Abstract:
Recursive block decomposition algorithms (also known as quadtree algorithms when the blocks are all square) have been proposed to solve well-known problems such as matrix addition, multiplication, inversion, determinant computation, block LDU decomposition and Cholesky and QR factorization. Until now, such algorithms have been seen as impractical, since they require leading submatrices of the input matrix to be invertible (which is rarely guaranteed). We show how to randomize an input matrix to guarantee that submatrices meet these requirements, and to make recursive block decomposition method
APA, Harvard, Vancouver, ISO, and other styles
7

Ghoniem, Nasr M. "Curved Parametric Segments for the Stress Field of 3-D Dislocation Loops." Journal of Engineering Materials and Technology 121, no. 2 (1999): 136–42. http://dx.doi.org/10.1115/1.2812358.

Full text
Abstract:
Under applied mechanical forces, strong mutual interaction or other thermodynamic forces, dislocation shapes become highly curved. We present here a new method for accurate computations of self and mutual interactions between dislocation loops. In this method, dislocation loops of arbitrary shapes are segmented with appropriate parametric equations representing the dislocation line vector. Field equations of infinitesimal linear elasticity are developed on the basis of isotropic elastic Green’s tensor functions. The accuracy and computational speed of the method are illustrated by computing th
APA, Harvard, Vancouver, ISO, and other styles
8

Bertrand, Fleurianne, Marcel Moldenhauer, and Gerhard Starke. "A Posteriori Error Estimation for Planar Linear Elasticity by Stress Reconstruction." Computational Methods in Applied Mathematics 19, no. 3 (2019): 663–79. http://dx.doi.org/10.1515/cmam-2018-0004.

Full text
Abstract:
AbstractThe nonconforming triangular piecewise quadratic finite element space by Fortin and Soulie can be used for the displacement approximation and its combination with discontinuous piecewise linear pressure elements is known to constitute a stable combination for incompressible linear elasticity computations. In this contribution, we extend the stress reconstruction procedure and resulting guaranteed a posteriori error estimator developed by Ainsworth, Allendes, Barrenechea and Rankin [2] and by Kim [18] to linear elasticity. In order to get a guaranteed reliability bound with respect to t
APA, Harvard, Vancouver, ISO, and other styles
9

Lindeberg, Tony. "Provably Scale-Covariant Continuous Hierarchical Networks Based on Scale-Normalized Differential Expressions Coupled in Cascade." Journal of Mathematical Imaging and Vision 62, no. 1 (2019): 120–48. http://dx.doi.org/10.1007/s10851-019-00915-x.

Full text
Abstract:
Abstract This article presents a theory for constructing hierarchical networks in such a way that the networks are guaranteed to be provably scale covariant. We first present a general sufficiency argument for obtaining scale covariance, which holds for a wide class of networks defined from linear and nonlinear differential expressions expressed in terms of scale-normalized scale-space derivatives. Then, we present a more detailed development of one example of such a network constructed from a combination of mathematically derived models of receptive fields and biologically inspired computatio
APA, Harvard, Vancouver, ISO, and other styles
10

Likhoded, N. A., and M. A. Paliashchuk. "Tiled parallel 2D computational processes." Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series 54, no. 4 (2019): 417–26. http://dx.doi.org/10.29235/1561-2430-2018-54-4-417-426.

Full text
Abstract:
The algorithm implemented on a parallel computer with distributed memory has, as a rule, a tiled structure: a set of operations is divided into subsets, called tiles. One of the modern approaches to obtaining tiled versions of algorithms is a tiling transformation based on information sections of the iteration space, resulting in macro-operations (tiles). The operations of one tile are performed atomically, as one unit of calculation, and the data exchange is done by arrays. The method of construction of tiled computational processes logically organized as a two-dimensional structure for algor
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Guaranteed computations"

1

Kanno, Masaaki. "Guaranteed accuracy computations in systems and control." Thesis, University of Cambridge, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615686.

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

Merdon, Christian. "Aspects of guaranteed error control in computations for partial differential equations." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://dx.doi.org/10.18452/16818.

Full text
Abstract:
Diese Arbeit behandelt garantierte Fehlerkontrolle für elliptische partielle Differentialgleichungen anhand des Poisson-Modellproblems, des Stokes-Problems und des Hindernisproblems. Hierzu werden garantierte obere Schranken für den Energiefehler zwischen exakter Lösung und diskreten Finite-Elemente-Approximationen erster Ordnung entwickelt. Ein verallgemeinerter Ansatz drückt den Energiefehler durch Dualnormen eines oder mehrerer Residuen aus. Hinzu kommen berechenbare Zusatzterme, wie Oszillationen der gegebenen Daten, mit expliziten Konstanten. Für die Abschätzung der Dualnormen der Resi
APA, Harvard, Vancouver, ISO, and other styles
3

Merdon, Christian [Verfasser], Carsten Akademischer Betreuer] Carstensen, Andreas [Akademischer Betreuer] Schröder, and Stefan [Akademischer Betreuer] [Funken. "Aspects of guaranteed error control in computations for partial differential equations / Christian Merdon. Gutachter: Carsten Carstensen ; Andreas Schröder ; Stefan Funken." Berlin : Humboldt Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2013. http://d-nb.info/1042247005/34.

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

Louédec, Morgan. "Guaranteed ellipsoidal numerical method for the stability analysis of the formation control of a group of underwater robots." Electronic Thesis or Diss., Brest, École nationale supérieure de techniques avancées Bretagne, 2024. http://www.theses.fr/2024ENTA0007.

Full text
Abstract:
Pour développer les activités marines humaines, des groupes de robots sous-marins peuvent automatiser certaines tâches. Ces robots étant difficiles à localiser en raison de contraintes sous-marines, ils doivent se déplacer en formation pour être fiables. Bien que plusieurs contrôleurs théoriques aient été proposés pour faire face à ces contraintes, ils doivent encore s’adapter à des contraintes plus complexes et être testés sur des systèmes réels. Comme pour tout système autonome, la stabilité de la formation doit être vérifiée par une preuve mathématique. Cependant, la complexité de ces systè
APA, Harvard, Vancouver, ISO, and other styles
5

Kratz, Gutstav. "Risk Modelling in Payment Guarantees." Thesis, KTH, Matematisk statistik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229418.

Full text
Abstract:
The Swedish Export Credit Agency (EKN) issues payment guarantees to Swedish companies who face the risk of non-payments in export transactions. Commitments are typically correlated, as defaults of companies are driven by other factors than factors specific to that company, such as the economic cycle or the regional conditions. In deciding upon how much capital to be reserved to remain solvent even in an unlikely scenario, this has to be accounted for in order to not underestimate financial risks.By studying models for credit risk and the research available in the area, the popular CreditRisk+
APA, Harvard, Vancouver, ISO, and other styles
6

Lu, Yu. "Statistical and Computational Guarantees for Learning Latent Variable Models." Thesis, Yale University, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10783452.

Full text
Abstract:
<p> Latent variable models are widely used to capture the underlying structures of the data, for example, Gaussian mixture models for speech recognition, stochastic block models for community detection and topic models for information retrieval. While alternative minimization based algorithms such as EM algorithm and Lloyd's algorithm performs well in practice, there has been little theoretical advancement in explaining the effectiveness of these algorithms. In this thesis, we investigate the performance of Lloyd's algorithm and EM algorithm on clustering two-mixture of Gaussians. With an init
APA, Harvard, Vancouver, ISO, and other styles
7

Kaynama, Shahab. "Scalable techniques for the computation of viable and reachable sets : safety guarantees for high-dimensional linear time-invariant systems." Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/42856.

Full text
Abstract:
Reachability analysis and viability theory are key in providing guarantees of safety and proving the existence of safety-preserving controllers for constrained dynamical systems. The minimal reachable tube and (by duality) the viability kernel are the only constructs that can be used for this purpose. Unfortunately, current numerical schemes that compute these constructs suffer from a complexity that is exponential in the dimension of the state, rendering them impractical for systems of dimension greater than three or four. In this thesis we propose two separate approaches that improve the sc
APA, Harvard, Vancouver, ISO, and other styles
8

Herhut, S. "Auxiliary computations : a framework for a step-wise, non-disruptive introduction of static guarantees to untyped programs using partial evaluation techniques." Thesis, University of Hertfordshire, 2010. http://hdl.handle.net/2299/4722.

Full text
Abstract:
Type inference can be considered a form of partial evaluation that only evaluates a program with respect to its type annotations. Building on this key observation, this dissertation presents a uniform framework for expressing computation, its dynamic properties and corresponding static type information. By using a unified approach, the static phase divide between values and types is lifted. Instead, computations and properties can be freely assigned to the static or dynamic phase of computation. Even more, moving a property from one world to the other does not require any program modifications
APA, Harvard, Vancouver, ISO, and other styles
9

Feng, Lu. "On learning assumptions for compositional verification of probabilistic systems." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:12502ba2-478f-429a-a250-6590c43a8e8a.

Full text
Abstract:
Probabilistic model checking is a powerful formal verification method that can ensure the correctness of real-life systems that exhibit stochastic behaviour. The work presented in this thesis aims to solve the scalability challenge of probabilistic model checking, by developing, for the first time, fully-automated compositional verification techniques for probabilistic systems. The contributions are novel approaches for automatically learning probabilistic assumptions for three different compositional verification frameworks. The first framework considers systems that are modelled as Segala pr
APA, Harvard, Vancouver, ISO, and other styles
10

(11196552), Kevin Segundo Bello Medina. "STRUCTURED PREDICTION: STATISTICAL AND COMPUTATIONAL GUARANTEES IN LEARNING AND INFERENCE." Thesis, 2021.

Find full text
Abstract:
<div>Structured prediction consists of receiving a structured input and producing a combinatorial structure such as trees, clusters, networks, sequences, permutations, among others. From the computational viewpoint, structured prediction is in general considered <i>intractable</i> because of the size of the output space being exponential in the input size. For instance, in image segmentation tasks, the number of admissible segments is exponential in the number of pixels. A second factor is the combination of the input dimensionality along with the amount of data under availability. In structur
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Guaranteed computations"

1

Liu, Xuefeng. Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-3577-8.

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

Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems. Springer, 2024.

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

Miranker, Willard L., Edgar W. Kaucher, and Werner Rheinboldt. Self-Validating Numerics for Function Space Problems: Computation with Guarantees for Differential and Integral Equations. Elsevier Science & Technology Books, 2014.

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

Succi, Sauro. Lattice Boltzmann Models for Microflows. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199592357.003.0029.

Full text
Abstract:
The Lattice Boltzmann method was originally devised as a computational alternative for the simulation of macroscopic flows, as described by the Navier–Stokes equations of continuum mechanics. In many respects, this still is the main place where it belongs today. Yet, in the past decade, LB has made proof of a largely unanticipated versatility across a broad spectrum of scales, from fully developed turbulence, to microfluidics, all the way down to nanoscale flows. Even though no systematic analogue of the Chapman–Enskog asymptotics is available in this beyond-hydro region (no guarantee), the fa
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Guaranteed computations"

1

Godunov, S. K., A. G. Antonov, O. P. Kiriljuk, and V. I. Kostin. "Peculiarities of Computer Computations." In Guaranteed Accuracy in Numerical Linear Algebra. Springer Netherlands, 1993. http://dx.doi.org/10.1007/978-94-011-1952-8_5.

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

Schauer, U., and R. A. Toupin. "Solving large sparse linear systems with guaranteed accuracy." In Accurate Scientific Computations. Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/3-540-16798-6_8.

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

Yang, Zhonghua, Chengzheng Sun, Abdul Sattar, and Yanyan Yang. "Guaranteed Mutually Consistent Checkpointing in Distributed Computations." In Advances in Computing Science ASIAN 98. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49366-2_13.

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

Liu, Xuefeng. "Guaranteed Eigenfunction Computation." In Guaranteed Computational Methods for Self-Adjoint Differential Eigenvalue Problems. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-97-3577-8_6.

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

Xu, Runqing, Liming Li, and Bohua Zhan. "Verified Interactive Computation of Definite Integrals." In Automated Deduction – CADE 28. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-79876-5_28.

Full text
Abstract:
AbstractSymbolic computation is involved in many areas of mathematics, as well as in analysis of physical systems in science and engineering. Computer algebra systems present an easy-to-use interface for performing these calculations, but do not provide strong guarantees of correctness. In contrast, interactive theorem proving provides much stronger guarantees of correctness, but requires more time and expertise. In this paper, we propose a general framework for combining these two methods, and demonstrate it using computation of definite integrals. It allows the user to carry out step-by-step
APA, Harvard, Vancouver, ISO, and other styles
6

Kieffer, Michel, Isabelle Braems, Éric Walter, and Luc Jaulin. "Guaranteed Set Computation with Subpavings." In Scientific Computing, Validated Numerics, Interval Methods. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4757-6484-0_14.

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

Jaulin, Luc, Michel Kieffer, Olivier Didrit, and Éric Walter. "Guaranteed Computation with Floating-point Numbers." In Applied Interval Analysis. Springer London, 2001. http://dx.doi.org/10.1007/978-1-4471-0249-6_10.

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

Mali, Olli, Pekka Neittaanmäki, and Sergey Repin. "Guaranteed Error Bounds I." In Computational Methods in Applied Sciences. Springer Netherlands, 2014. http://dx.doi.org/10.1007/978-94-007-7581-7_3.

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

Mali, Olli, Pekka Neittaanmäki, and Sergey Repin. "Guaranteed Error Bounds II." In Computational Methods in Applied Sciences. Springer Netherlands, 2014. http://dx.doi.org/10.1007/978-94-007-7581-7_4.

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

Flórez, Jorge, Mateu Sbert, Miguel A. Sainz, and Josep Vehí. "Guaranteed Adaptive Antialiasing Using Interval Arithmetic." In Computational Science – ICCS 2007. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72586-2_24.

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

Conference papers on the topic "Guaranteed computations"

1

Jimenez-Garcia, Antonio, and George Barakos. "Implementation of High-Order Methods in the HMB CFD Solver." In Vertical Flight Society 73rd Annual Forum & Technology Display. The Vertical Flight Society, 2017. http://dx.doi.org/10.4050/f-0073-2017-12011.

Full text
Abstract:
This work presents the development and implementation of an efficient, compact high-order finite-volume scheme in the HMB CFD solver. This formulation is based on the variable extrapolation MUSCL-scheme, where high-order spatial accuracy (up to 4th-order) is achieved using high-order correction terms through a successive differentiation. The scheme has also been modified to cope with physical and multiblock mesh interfaces, so stability, conservativeness, and high-order accuracy are guaranteed. A wide variety of results for the underlying method are presented, including two-and three-dimension
APA, Harvard, Vancouver, ISO, and other styles
2

Rego, Francisco, and Daniel Silvestre. "Explicit Computation of Guaranteed State Estimates using Constrained Convex Generators." In 2024 IEEE 63rd Conference on Decision and Control (CDC). IEEE, 2024. https://doi.org/10.1109/cdc56724.2024.10885976.

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

Aras, Chinmay M., Ashfaq Iftakher, and M. M. Faruque Hasan. "Guaranteed Error-bounded Surrogate Framework for Solving Process Simulation Problems." In Foundations of Computer-Aided Process Design. PSE Press, 2024. http://dx.doi.org/10.69997/sct.182073.

Full text
Abstract:
Process simulation problems often involve systems of nonlinear and nonconvex equations and may run into convergence issues due to the existence of recycle loops within such models. To that end, surrogate models have gained significant attention as an alternative to high-fidelity models as they significantly reduce the computational burden. However, these models do not always provide a guarantee on the prediction accuracy over the domain of interest. To address this issue, we strike a balance between computational complexity by developing a data-driven branch and prune-based framework that prog
APA, Harvard, Vancouver, ISO, and other styles
4

Kanno, M., and M. C. Smith. "Guaranteed accuracy computations in systems and control." In 2003 European Control Conference (ECC). IEEE, 2003. http://dx.doi.org/10.23919/ecc.2003.7084967.

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

Bajard, Jean-Claude, Philippe Langlois, Dominique Michelucci, Géraldine Morin, and Nathalie Revol. "Floating-point geometry: toward guaranteed geometric computations with approximate arithmetics." In Optical Engineering + Applications, edited by Franklin T. Luk. SPIE, 2008. http://dx.doi.org/10.1117/12.796597.

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

Abdeltawab, Hussein. "Optimal Stochastic Dispatch of Combined Heat Power System with Guaranteed Heat Trading." In 2022 10th International Japan-Africa Conference on Electronics, Communications, and Computations (JAC-ECC). IEEE, 2022. http://dx.doi.org/10.1109/jac-ecc56395.2022.10043939.

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

Dudaško, Ján, and Bernhard Semlitsch. "On the Numerical Efficacy Evaluation of Industrial Droplet Separators." In ASME 2024 Power Conference. American Society of Mechanical Engineers, 2024. http://dx.doi.org/10.1115/power2024-138858.

Full text
Abstract:
Abstract Droplet separators are essential components of the chemical process chain. If malfunctioning, the remaining droplets can damage the downstream elements. Thus, reliable functioning is critical and has to be guaranteed for all operating conditions. Computational fluid dynamic computations are commonly employed to analyse the turbulent flow in droplet separators and predict their efficiency. The two-phase flow is modelled using the k-omega SST turbulence model, while the trajectories of fluid particle distributions are computed to quantify the droplet separator efficiency. Fine wall reso
APA, Harvard, Vancouver, ISO, and other styles
8

Law, Mark, Krysia Broda, and Alessandra Russo. "Search Space Expansion for Efficient Incremental Inductive Logic Programming from Streamed Data." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/374.

Full text
Abstract:
In the past decade, several systems for learning Answer Set Programs (ASP) have been proposed, including the recent FastLAS system. Compared to other state-of-the-art approaches to learning ASP, FastLAS is more scalable, as rather than computing the hypothesis space in full, it computes a much smaller subset relative to a given set of examples that is nonetheless guaranteed to contain an optimal solution to the task (called an OPT-sufficient subset). On the other hand, like many other Inductive Logic Programming (ILP) systems, FastLAS is designed to be run on a fixed learning task meaning that
APA, Harvard, Vancouver, ISO, and other styles
9

Arab, Aliasghar, Jingang Yi, Mohammad Mahdi Fateh, and Soroush Arabshahi. "Robust Control of a Low-Cost Mobile Robot Using a Neural Network Uncertainty Compensator." In ASME 2014 Dynamic Systems and Control Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/dscc2014-6190.

Full text
Abstract:
This paper presents a robust control design for a low-cost mobile robot under modeling uncertainties and external disturbances. We use a radial basis function neural network (RBFNN) to estimate and compensate for the model uncertainties and external disturbances. The proposed control design is model-free with guaranteed stability and good path-following performance. The RBFNN weight regulation and adaptive gains are designed based on the Lypanov method. Simulation and experimental results illustrate the design and demonstrate the strength of the proposed control applied to a nonholonomic wheel
APA, Harvard, Vancouver, ISO, and other styles
10

Nicoud, Didier, Catherine Le Bloa, and Olivier-Pierre Jacquotte. "A Finite Element Inverse Method for the Design of Turbomachinery Blades." In ASME 1991 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/91-gt-080.

Full text
Abstract:
We present a quasi-3D inverse method for the design of turbomachinery blades corresponding to a velocity distribution given arbitrarily. The theoretical aspect of the problem is first investigated, then the equations governing the quasi three-dimensional potential model are reviewed. The inverse method consists of solving the potential equation with Dirichlet boundary conditions on the profile, then modifying the profile iteratively until there is no mass flux through its surface. The convergence of the process is guaranteed by the preliminary theoretical study. The method is implemented using
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Guaranteed computations"

1

Juvva, Kanaka. Coscheduling of Computation and Communication Resoures in Push-Pull Communications to Provide End-To-End QoS Guarantees. Defense Technical Information Center, 1999. http://dx.doi.org/10.21236/ada370066.

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

Debuque-Gonzales, Margarita, Charlotte Justine Diokno-Sicat, John Paul Corpus, Robert Hector Palomar, Mark Gerald Ruiz, and Ramona Maria Miral. Fiscal Effects of the COVID-19 Pandemic: Assessing Public Debt Sustainability in the Philippines. Philippine Institute for Development Studies, 2022. https://doi.org/10.62986/dp2022.17.

Full text
Abstract:
This paper examines whether the current level of debt in the country, given the national government’s fiscal policy and plans, remains on a sustainable path. By end-2021, a year after the peak of the public health and economic crisis brought about by the COVID-19 pandemic, the country’s debt-to-GDP ratio had already climbed to 60.5 percent, over 20 percentage points above pre-pandemic levels and slightly above the government’s indicative cap. Several empirical exercises were performed in this paper to investigate the country’s fiscal solvency, namely by (1) providing a historical decomposition
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!