Relevant bibliographies by topics / Functional algorithms

Academic literature on the topic 'Functional algorithms'

Author: Grafiati
Published: 14 March 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Functional algorithms.'

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 "Functional algorithms"

1

Blelloch, Guy E. "Functional parallel algorithms." ACM SIGPLAN Notices 45, no. 9 (September 27, 2010): 247. http://dx.doi.org/10.1145/1932681.1863579.

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

Shurup,, Andrei S. "NUMERICAL COMPARISON OF ITERATIVE AND FUNCTIONAL-ANALYTICAL ALGORITHMS FOR INVERSE ACOUSTIC SCATTERING." Eurasian Journal of Mathematical and Computer Applications 10, no. 1 (March 2022): 79–99. http://dx.doi.org/10.32523/2306-6172-2022-10-1-79-99.

Full text
Abstract:
Abstract In this work the numerical solution of acoustic tomography problem based on the iterative and functional-analytical algorithms is considered. The mathematical properties of these algorithms were previously described in works of R.G. Novikov for the case of the Schr ̈odinger equation. In the present work, for the case of two-dimensional scalar Helmholtz equation, the efficiency of the iterative algorithm in reconstruction of middle strength scat- terers and advantages of the functional-analytical approach in recovering strong scatterers are demonstrated. A filtering procedure is considered in the space of wave vectors, which additionally increases the convergence of the iterative algorithm. Reconstruction results of sound speed perturbations demonstrate the comparable noise immunity and resolution of the considered algorithms when reconstructing middle strength scatterers. A comparative nu- merical investigation of the iterative and functional-analytical algorithms in inverse acoustic scattering problems is implemented in this work for the first time.
APA, Harvard, Vancouver, ISO, and other styles
3

Blelloch, Guy E., and Robert Harper. "Cache efficient functional algorithms." Communications of the ACM 58, no. 7 (June 25, 2015): 101–8. http://dx.doi.org/10.1145/2776825.

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

BIRD, RICHARD S. "FUNCTIONAL PEARL Unfolding pointer algorithms." Journal of Functional Programming 11, no. 3 (May 2001): 347–58. http://dx.doi.org/10.1017/s0956796801003914.

Full text
Abstract:
A fair amount has been written on the subject of reasoning about pointer algorithms. There was a peak about 1980 when everyone seemed to be tackling the formal verification of the Schorr–Waite marking algorithm, including Gries (1979, Morris (1982) and Topor (1979). Bornat (2000) writes: “The Schorr–Waite algorithm is the first mountain that any formalism for pointer aliasing should climb”. Then it went more or less quiet for a while, but in the last few years there has been a resurgence of interest, driven by new ideas in relational algebras (Möeller, 1993), in data refinement Butler (1999), in type theory (Hofmann, 2000; Walker and Morrisett, 2000), in novel kinds of assertion (Reynolds, 2000), and by the demands of mechanised reasoning (Bornat, 2000). Most approaches end up being based in the Floyd–Dijkstra–Hoare tradition with loops and invariant assertions. To be sure, when dealing with any recursively-defined linked structure some declarative notation has to be brought in to specify the problem, but no one to my knowledge has advocated a purely functional approach throughout. Mason (1988) comes close, but his Lisp expressions can be very impure. Möller (1999) also exploits an algebraic approach, and the structure of his paper has much in common with what follows.This pearl explores the possibility of a simple functional approach to pointer manipulation algorithms.
APA, Harvard, Vancouver, ISO, and other styles
5

OKASAKI, CHRIS. "Special issue on Algorithmic aspects of functional programming languages." Journal of Functional Programming 11, no. 5 (August 29, 2001): 439–40. http://dx.doi.org/10.1017/s0956796801004142.

Full text
Abstract:
Algorithms can be dramatically affected by the language in which they are implemented. An algorithm that is elegant and efficient in one language may be ugly and inefficient in another. If you have ever attempted to implement an assignment-intensive algorithm in a functional programming language, you are probably more familiar with this phenomenon than you ever wanted to be! But this sword does not cut in only one direction. Functional programming languages are wonderfully suited to expressing certain kinds of algorithms in a clean, modular way, and researchers over the last five to ten years have greatly expanded the range of algorithms for which this is true.
APA, Harvard, Vancouver, ISO, and other styles
6

Cormode, Graham, S. Muthukrishnan, and Ke Yi. "Algorithms for distributed functional monitoring." ACM Transactions on Algorithms 7, no. 2 (March 2011): 1–20. http://dx.doi.org/10.1145/1921659.1921667.

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

Bird, R. S. "Functional Pearls Two greedy algorithms." Journal of Functional Programming 2, no. 2 (April 1992): 237–44. http://dx.doi.org/10.1017/s0956796800000368.

Full text
Abstract:
At the recent TC2 working conference on constructing programs from specifications (Moeller, 1991), I presented the derivation of a functional program for solving a problem posed by Knuth (1990). Slightly simplified, the problem was to construct a shortest decimal fraction representing a given integer multiple of 1/216. Later in the conference – and in a different context – Robert Dewar described a second problem that he had recently set as an examination question. In brief, the problem was to replace sequences of blanks in a file by tab characters wherever possible. Although Knuth's and Dewar's problems appear to have little in common, I suspected that both had the same ‘deep structure’ and were instances of a single general result about greedy algorithms. The purpose of this note is to bring the genral result to light and to unify the treatment of the two problems. We begin by describing the problems more precisely.
APA, Harvard, Vancouver, ISO, and other styles
8

Bird, Richard S. "Functional Pearls: Unravelling greedy algorithms." Journal of Functional Programming 2, no. 3 (July 1992): 375–85. http://dx.doi.org/10.1017/s0956796800000459.

Full text
Abstract:
In my previous Functional Pearls article (Bird, 1992), I proved a theorem giving conditions under which an optimization problem could be implemented by a greedy algorithm. A greedy algorithm is one that picks a ‘best’ element at each stage. Here, we return to this theorem and extend it in various ways. We then use the theory to solve an intriguing problem about unravelling sequences into a smallest number of ascending subsequences.
APA, Harvard, Vancouver, ISO, and other styles
9

DeRose, Tony D., Ronald N. Goldman, Hans Hagen, and Stephen Mann. "Functional composition algorithms via blossoming." ACM Transactions on Graphics 12, no. 2 (April 1993): 113–35. http://dx.doi.org/10.1145/151280.151290.

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

Gelchinsky, B., E. Landa, and V. Shtivelman. "Algorithms of phase and group correlation." GEOPHYSICS 50, no. 4 (April 1985): 596–608. http://dx.doi.org/10.1190/1.1441935.

Full text
Abstract:
In this paper we consider algorithms of phase and group correlation which are based on different assumptions regarding the character of wave field. In order to construct the correlation algorithm, the wave field is presented as a product of an envelope and a normalized seismogram. Phase correlation is performed on the normalized seismogram, while group correlation is performed on the perigram, a low cut version of the envelope function. The central point of the correlation algorithm is the construction of a functional which characterizes the main correlation properties of the wave field. This functional is computed for different values of parameters which appear in the expressions approximating phase and group traveltime curves. Several types of correlation functionals are considered. The next step of the correlation algorithm is analysis of the previously obtained functionals; this is performed using a system of inequalities based on a number of assumptions regarding the properties of wave fields. The results of this analysis permit us to make a decision regarding the presence of a signal and to estimate the parameters of detected waves. Examples illustrating application of the proposed algorithm to synthetic and field data are presented.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Functional algorithms"

1

King, David Jonathan. "Functional programming and graph algorithms." Thesis, University of Glasgow, 1996. http://theses.gla.ac.uk/1629/.

Full text
Abstract:
This thesis is an investigation of graph algorithms in the non-strict purely functional language Haskell. Emphasis is placed on the importance of achieving an asymptotic complexity as good as with conventional languages. This is achieved by using the monadic model for including actions on the state. Work on the monadic model was carried out at Glasgow University by Wadler, Peyton Jones, and Launchbury in the early nineties and has opened up many diverse application areas. One area is the ability to express data structures that require sharing. Although graphs are not presented in this style, data structures that graph algorithms use are expressed in this style. Several examples of stateful algorithms are given including union/find for disjoint sets, and the linear time sort binsort. The graph algorithms presented are not new, but are traditional algorithms recast in a functional setting. Examples include strongly connected components, biconnected components, Kruskal's minimum cost spanning tree, and Dijkstra's shortest paths. The presentation is lucid giving more insight than usual. The functional setting allows for complete calculational style correctness proofs - which is demonstrated with many examples. The benefits of using a functional language for expressing graph algorithms are quantified by looking at the issues of execution times, asymptotic complexity, correctness, and clarity, in comparison with traditional approaches. The intention is to be as objective as possible, pointing out both the weaknesses and the strengths of using a functional language.
APA, Harvard, Vancouver, ISO, and other styles
2

Karmakar, Saurav. "Statistical Stability and Biological Validity of Clustering Algorithms for Analyzing Microarray Data." Digital Archive @ GSU, 2005. http://digitalarchive.gsu.edu/math_theses/3.

Full text
Abstract:
Simultaneous measurement of the expression levels of thousands to ten thousand genes in multiple tissue types is a result of advancement in microarray technology. These expression levels provide clues about the gene functions and that have enabled better diagnosis and treatment of serious disease like cancer. To solve the mystery of unknown gene functions, biological to statistical mapping is needed in terms of classifying the genes. Here we introduce a novel approach of combining both statistical consistency and biological relevance of the clusters produced by a clustering method. Here we employ two performance measures in combination for measuring statistical stability and functional similarity of the cluster members using a set of gene expressions with known biological functions. Through this analysis we construct a platform to predict about unknown gene functions using the outperforming clustering algorithm.
APA, Harvard, Vancouver, ISO, and other styles
3

Danilenko, Nikita [Verfasser]. "Designing Functional Implementations of Graph Algorithms / Nikita Danilenko." Kiel : Universitätsbibliothek Kiel, 2016. http://d-nb.info/1102933031/34.

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

Klingner, John. "Distributed and Decentralized Algorithms for Functional Programmable Matter." Thesis, University of Colorado at Boulder, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10980638.

Full text
Abstract:

Programmable matter is made up of large quantities of particles that can sense, actuate, communicate, and compute. Motivated to imbue these materials with functionality, this thesis presents algorithmic and hardware developments to meet the unique challenges presented by large-scale robot collectives. The quantity of robots involved necessitates algorithms and processes which scale—in terms of required communication, computation, and memory—sub-linearly to the number of robots, if scaling at all can not be avoided. Included are methods for communication, movement, synchronization, and localization. To encourage application to a variety of hardware platforms, the theoretical underpinnings of these contributions are made as abstract as possible. These methods are tested experimentally with real hardware, using the Droplet swarm robotics platform I have developed. I also present abstractions which relate global performance properties of a functional object composed of programmable matter to local properties of the hardware platform from which the object is composed. This thesis is further supported by example implementations of functional objects on the Droplets: a TV remote control, a pong game, and a keyboard with mouse.

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

Hu, Jialu [Verfasser]. "Algorithms to Identify Functional Orthologs And Functional Modules from High-Throughput Data / Jialu Hu." Berlin : Freie Universität Berlin, 2015. http://d-nb.info/1064869807/34.

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

Ilberg, Peter. "Floyd : a functional programming language with distributed scope." Thesis, Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/8187.

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

Demir, Sumeyra Ummuhan. "Image Processing Algorithms for Diagnostic Analysis of Microcirculation." VCU Scholars Compass, 2010. http://scholarscompass.vcu.edu/etd/137.

Full text
Abstract:
Microcirculation has become a key factor for the study and assessment of tissue perfusion and oxygenation. Detection and assessment of the microvasculature using videomicroscopy from the oral mucosa provides a metric on the density of blood vessels in each single frame. Information pertaining to the density of these microvessels within a field of view can be used to quantitatively monitor and assess the changes occurring in tissue oxygenation and perfusion over time. Automated analysis of this information can be used for real-time diagnostic and therapeutic planning of a number of clinical applications including resuscitation. The objective of this study is to design an automated image processing system to segment microvessels, estimate the density of blood vessels in video recordings, and identify the distribution of blood flow. The proposed algorithm consists of two main stages: video processing and image segmentation. The first step of video processing is stabilization. In the video stabilization step, block matching is applied to the video frames. Similarity is measured by cross-correlation coefficients. The main technique used in the segmentation step is multi-thresholding and pixel verification based on calculated geometric and contrast parameters. Segmentation results and differences of video frames are then used to identify the capillaries with blood flow. After categorizing blood vessels as active or passive, according to the amount of blood flow, quantitative measures identifying microcirculation are calculated. The algorithm is applied to the videos obtained using Microscan Side-stream Dark Field (SDF) imaging technique captured from healthy and critically ill humans/animals. Segmentation results were compared and validated using a blind detailed inspection by experts who used a commercial semi-automated image analysis software program, AVA (Automated Vascular Analysis). The algorithm was found to extract approximately 97% of functionally active capillaries and blood vessels in every frame. The aim of this study is to eliminate the human interaction, increase accuracy and reduce the computation time. The proposed method is an entirely automated process that can perform stabilization, pre-processing, segmentation, and microvessel identification without human intervention. The method may allow for assessment of microcirculatory abnormalities occurring in critically ill and injured patients including close to real-time determination of the adequacy of resuscitation.
APA, Harvard, Vancouver, ISO, and other styles
8

Belešová, Michaela. "Aplikace evolučního algoritmu při tvorbě regresních testů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-236142.

Full text
Abstract:
This master thesis deals with application of an evolutionary algorithm in the creation of regression tests. In the first section, description of functional verification, verification methodology, regression tests and evolutionary algorithms is provided. In the following section, the evolutionary algorithm, the purpose of which is to achieve reduction of the number of test vectors obtained in the process of functional verification, is proposed. Afterwards, the proposed algorithm is implemented and a set of experiments is evaluated. The results are discussed.
APA, Harvard, Vancouver, ISO, and other styles
9

Shafi, Muhammmad Imran, and Muhammad Akram. "Functional Approach towards Approximation Problem." Thesis, Blekinge Tekniska Högskola, Avdelningen för för interaktion och systemdesign, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-1245.

Full text
Abstract:
Approximation algorithms are widely used for problems related to computational geometry, complex optimization problems, discrete min-max problems and NP-hard and space hard problems. Due to the complex nature of such problems, imperative languages are perhaps not the best-suited solution when it comes to their actual implementation. Functional languages like Haskell could be a good candidate for the aforementioned mentioned issues. Haskell is used in industries as well as in commercial applications, e.g., concurrent applications, statistics, symbolic math and financial analysis. Several approximation algorithms have been proposed for different problems that naturally arise in the DNA clone classifications. In this thesis, we have performed an initial and explorative study on applying functional languages for approximation algorithms. Specifically, we have implemented a well known approximate clustering algorithm both in Haskell and in Java and we discuss the suitability of applying functional languages for the implementation of approximation algorithms, in particular for graph theoretical approximate clustering problems with applications in DNA clone classification. We also further explore the characteristics of Haskell that makes it suitable for solving certain classes of problems that are hard to implement using imperative languages.
Muhammad Imran Shafi: 29A Sodergatan 19547 Marsta, 0737171514, Muhammad Akram C/O Saad Bin Azhar Folkparksvagen 20/10 Ronneby, 0762899111
APA, Harvard, Vancouver, ISO, and other styles
10

Toh, Justin Sieu-Sung. "Iterative diagonalisation algorithms in plane wave density functional theory with applications to surfaces." Thesis, University of Cambridge, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.615143.

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

Books on the topic "Functional algorithms"

1

Stone, John David. Algorithms for Functional Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57970-1.

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

Rabhi, Fethi. Algorithms: A functional approach. 2nd ed. Harlow, England: Addison-Wesley, 1999.

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

Guy, Lapalme, ed. Algorithms: A functional programming approach. 2nd ed. Harlow, England: Addison-Wesley, 1999.

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

Pearls of functional algorithm design. New York: Cambridge University Press, 2010.

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

Curien, Pierre-Louis. Categorical Combinators, Sequential Algorithms, and Functional Programming. Boston, MA: Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4612-0317-9.

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

Curien, P. L. Categorical combinators, sequential algorithms, and functional programming. 2nd ed. Boston: Birkhäuser, 1993.

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

Categorical combinators, sequential algorithms, and functional programming. London: Pitman, 1986.

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

Goedecker, S. Low complexity algorithms for density functional electronic structure calculations. Ithaca, N.Y: Cornell Theory Center, Cornell University, 1993.

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

Crosbie, Caroline. A Functional Writing Package and Middle School Special Education Students’ Math Algorithms. [New York, N.Y.?]: [publisher not identified], 2018.

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

Neittaanmäki, P. Optimal control of nonlinear parabolic systems: Theory, algorithms, and applications. New York: M. Dekker, 1994.

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

Book chapters on the topic "Functional algorithms"

1

Bird, Richard S. "Loopless Functional Algorithms." In Lecture Notes in Computer Science, 90–114. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11783596_9.

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

Aczél, J., and L. Losonczi. "Extension of Functional Equations." In Algorithms and Combinatorics, 251–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60406-5_23.

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

Simpson, Alex K. "Lazy functional algorithms for exact real functionals." In Mathematical Foundations of Computer Science 1998, 456–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055795.

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

Curien, Pierre-Louis. "Sequential Algorithms." In Categorical Combinators, Sequential Algorithms, and Functional Programming, 159–250. Boston, MA: Birkhäuser Boston, 1993. http://dx.doi.org/10.1007/978-1-4612-0317-9_2.

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

Stone, John David. "Essential Notations." In Algorithms for Functional Programming, 1–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57970-1_1.

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

Stone, John David. "The Tool Box." In Algorithms for Functional Programming, 39–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57970-1_2.

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

Stone, John David. "Data Structures." In Algorithms for Functional Programming, 83–201. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57970-1_3.

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

Stone, John David. "Sorting." In Algorithms for Functional Programming, 203–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57970-1_4.

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

Stone, John David. "Combinatorial Constructions." In Algorithms for Functional Programming, 261–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57970-1_5.

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

Stone, John David. "Graphs." In Algorithms for Functional Programming, 297–346. Berlin, Heidelberg: Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-57970-1_6.

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

Conference papers on the topic "Functional algorithms"

1

Blelloch, Guy E. "Functional parallel algorithms." In the 15th ACM SIGPLAN international conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1863543.1863579.

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

Sheffi, Gali, and Erez Petrank. "Functional Faults." In SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3350755.3400261.

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

Meng, Joe, Chun (Chuck) Zhang, H. P. Ben Wang, and Yunkui Xiao. "Benchmarking of CMM Form-Fitting Algorithms for Functional Tolerance Analysis." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/dac-8705.

Full text
Abstract:
Abstract As the most commonly used computer aided inspection device in precision manufacturing, coordinate measuring machines (CMM’s) have drawn extensive interests from both researchers and practitioners. Different form-fitting algorithms have been developed to process the sampling data gathered by CMM’s. The two most commonly used form-fitting algorithms, the least squares (LS) and the minimum zone (MZ), have caused a lot of controversies in their applications for evaluations of part tolerances and functions. One of the key issues in CMM applications is to study the effectiveness of the algorithms on part functions and what result will be incurred if an inappropriate algorithm is applied. Through a case study, this paper focuses on benchmarking of the least squares and the minimum zone algorithms for functional tolerance analysis. Comparisons are also conducted to study the Type I and Type II errors which could be caused by applying the least squares and the minimum zone algorithms, respectively. The final result shows that the minimum zone algorithm is better than the least squares algorithm.
APA, Harvard, Vancouver, ISO, and other styles
4

Browning, Sally. "Cryptol, a DSL for cryptographic algorithms." In ACM SIGPLAN Commercial Users of Functional Programming. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1900160.1900171.

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

Sadakane, Kunihiko, and Gonzalo Navarro. "Fully-Functional Succinct Trees." In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2010. http://dx.doi.org/10.1137/1.9781611973075.13.

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

Wei, Ziheng, Sven Hartmann, and Sebastian Link. "Discovery Algorithms for Embedded Functional Dependencies." In SIGMOD/PODS '20: International Conference on Management of Data. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3318464.3389786.

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

Dybdal, Martin, Martin Elsman, Bo Joel Svensson, and Mary Sheeran. "Low-level functional GPU programming for parallel algorithms." In ICFP'16: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2975991.2975996.

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

Wang, Yisu Remy, Diogenes Nunez, and Kathleen Fisher. "Autobahn: using genetic algorithms to infer strictness annotations." In ICFP'16: ACM SIGPLAN International Conference on Functional Programming. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2976002.2976009.

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

Blelloch, Guy E., and Robert Harber. "Cache and I/O efficent functional algorithms." In the 40th annual ACM SIGPLAN-SIGACT symposium. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2429069.2429077.

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

Yuan, Min, Sheng Bin, Chi-Cheng Chen, and Gengxin Sun. "Algorithms for Multi-Functional Complex Network Model." In 2020 IEEE 2nd Eurasia Conference on Biomedical Engineering, Healthcare and Sustainability (ECBIOS). IEEE, 2020. http://dx.doi.org/10.1109/ecbios50299.2020.9203696.

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

Reports on the topic "Functional algorithms"

1

Takala, Tapio, James Hahn, Larry Gritz, Joe Geigel, and Jong W. Lee. Using Physically-Based Models and Genetic Algorithms for Functional Composition of Sound Signals, Synchronized to Animated Motion. Fort Belvoir, VA: Defense Technical Information Center, September 1993. http://dx.doi.org/10.21236/ada456431.

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

Liu, Ju, Hector Gomez, John A. Evans, Thomas J. Hughes, and Chad M. Landis. Functional Entropy Variables: A New Methodology for Deriving Thermodynamically Consistent Algorithms for Complex Fluids, with Particular Reference to the Isothermal Navier-Stokes-Korteweg Equations. Fort Belvoir, VA: Defense Technical Information Center, November 2012. http://dx.doi.org/10.21236/ada572015.

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

Lewis, Dustin. Three Pathways to Secure Greater Respect for International Law concerning War Algorithms. Harvard Law School Program on International Law and Armed Conflict, 2020. http://dx.doi.org/10.54813/wwxn5790.

Full text
Abstract:
Existing and emerging applications of artificial intelligence in armed conflicts and other systems reliant upon war algorithms and data span diverse areas. Natural persons may increasingly depend upon these technologies in decisions and activities related to killing combatants, destroying enemy installations, detaining adversaries, protecting civilians, undertaking missions at sea, conferring legal advice, and configuring logistics. In intergovernmental debates on autonomous weapons, a normative impasse appears to have emerged. Some countries assert that existing law suffices, while several others call for new rules. Meanwhile, the vast majority of efforts by States to address relevant systems focus by and large on weapons, means, and methods of warfare. Partly as a result, the broad spectrum of other far-reaching applications is rarely brought into view. One normatively grounded way to help identify and address relevant issues is to elaborate pathways that States, international organizations, non-state parties to armed conflict, and others may pursue to help secure greater respect for international law. In this commentary, I elaborate on three such pathways: forming and publicly expressing positions on key legal issues, taking measures relative to their own conduct, and taking steps relative to the behavior of others. None of these pathways is sufficient in itself, and there are no doubt many others that ought to be pursued. But each of the identified tracks is arguably necessary to ensure that international law is — or becomes — fit for purpose. By forming and publicly expressing positions on relevant legal issues, international actors may help clarify existing legal parameters, pinpoint salient enduring and emerging issues, and detect areas of convergence and divergence. Elaborating legal views may also help foster greater trust among current and potential adversaries. To be sure, in recent years, States have already fashioned hundreds of statements on autonomous weapons. Yet positions on other application areas are much more difficult to find. Further, forming and publicly expressing views on legal issues that span thematic and functional areas arguably may help States and others overcome the current normative stalemate on autonomous weapons. Doing so may also help identify — and allocate due attention and resources to — additional salient thematic and functional areas. Therefore, I raise a handful of cross-domain issues for consideration. These issues touch on things like exercising human agency, reposing legally mandated evaluative decisions in natural persons, and committing to engage only in scrutable conduct. International actors may also take measures relative to their own conduct. To help illustrate this pathway, I outline several such existing measures. In doing so, I invite readers to inventory and peruse these types of steps in order to assess whether the nature or character of increasingly complex socio-technical systems reliant upon war algorithms and data may warrant revitalized commitments or adjustments to existing measures — or, perhaps, development of new ones. I outline things like enacting legislation necessary to prosecute alleged perpetrators of grave breaches, making legal advisers available to the armed forces, and taking steps to prevent abuses of the emblem. Finally, international actors may take measures relative to the conduct of others. To help illustrate this pathway, I outline some of the existing steps that other States, international organizations, and non-state parties may take to help secure respect for the law by those undertaking the conduct. These measures may include things like addressing matters of legal compliance by exerting diplomatic pressure, resorting to penal sanctions to repress violations, conditioning or refusing arms transfers, and monitoring the fate of transferred detainees. Concerning military partnerships in particular, I highlight steps such as conditioning joint operations on a partner’s compliance with the law, planning operations jointly in order to prevent violations, and opting out of specific operations if there is an expectation that the operations would violate applicable law. Some themes and commitments cut across these three pathways. Arguably, respect for the law turns in no small part on whether natural persons can and will foresee, understand, administer, and trace the components, behaviors, and effects of relevant systems. It may be advisable, moreover, to institute ongoing cross-disciplinary education and training as well as the provision of sufficient technical facilities for all relevant actors, from commanders to legal advisers to prosecutors to judges. Further, it may be prudent to establish ongoing monitoring of others’ technical capabilities. Finally, it may be warranted for relevant international actors to pledge to engage, and to call upon others to engage, only in armed-conflict-related conduct that is sufficiently attributable, discernable, and scrutable.
APA, Harvard, Vancouver, ISO, and other styles
4

Kuropiatnyk, D. I. Actuality of the problem of parametric identification of a mathematical model. [б. в.], December 2018. http://dx.doi.org/10.31812/123456789/2885.

Full text
Abstract:
The purpose of the article is to study the possibilities of increasing the efficiency of a mathematical model by identifying the parameters of an object. A key factor for parametrization can be called the consideration of properties of the values of the model at a specific time point, which allows a deeper analysis of data dependencies and correlation between them. However, such a technique does not always work, because in advance it is impossible to predict that the parameters can be substantially optimized. In addition, it is necessary to take into account the fact that minimization reduces the values of parameters without taking into account their real physical properties. The correctness of the final values will be based on dynamically selected parameters, which allows you to modify the terms of use of the system in real time. In the development process, the values of experimentally obtained data with the model are compared, which allows you to understand the accuracy of minimization. When choosing the most relevant parameters, various minimization functions are used, which provides an opportunity to cover a wide range of theoretical initial situations. Verification of the correctness of the decision is carried out with the help of a quality function, which can identify the accuracy and correctness of the optimized parameters. It is possible to choose different types of functional quality, depending on the characteristics of the initial data. The presence of such tools during parametrization allows for varied analysis of the model, testing it on various algorithms, data volumes and conditions of guaranteed convergence of functional methods.
APA, Harvard, Vancouver, ISO, and other styles
5

Küsters, Ralf, and Alex Borgida. What's in an Attribute? Consequences for the Least Common Subsumer. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.102.

Full text
Abstract:
Functional relationships between objects, called 'attributes', are of considerable importance in knowledge representation languages, including Description Logics (DLs). A study of the literature indicates that papers have made, often implicity, different assumptions about the nature of attributes: whether they are always required to have a value, or whether they can be partial functions. The work presented here is the first explicit study of this difference for (sub-)classes of the CLASSIC DL, involving the same-as concept constructor. It is shown that although determining subsumption between concept descriptions has the same complexity (though requiring different algorithms), the story is different in the case of determining the least common subsumer (lcs). For attributes interpreted as partial functions, the lcs exists and can be computed relatively easily; even in this case our results correct and extend three previous papers about the lcs of DLs. In the case where attributes must have a value, the lcs may not exist, and even if it exists it may be of exponential size. Interestingly, it is possible to decide in polynomial time if the lcs exists.
APA, Harvard, Vancouver, ISO, and other styles
6

Wright, Alan F. A new algorithm for constructing the exchange operator in density-functional-theory calculations using hybrid functionals. Office of Scientific and Technical Information (OSTI), August 2015. http://dx.doi.org/10.2172/1222447.

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

Apostolatos, A., B. Keith, C. Soriano, and R. Rossi. D6.1 Deterministic optimization software. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.018.

Full text
Abstract:
This deliverable focuses on the implementation of deterministic optimization algorithms and problem solvers within KRATOS open-source software. One of the main challenges of optimization algorithms in Finite-Element based optimization is how to get the gradient of response functions which are used as objective and constraints when this is not available in an explicit form. The idea is to use local sensitivity analysis to get the gradient of the response function(s)
APA, Harvard, Vancouver, ISO, and other styles
8

Cummins, J. L. CMM functional software evaluation (algorithm qualification). Final report. Office of Scientific and Technical Information (OSTI), January 1995. http://dx.doi.org/10.2172/10115647.

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

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], November 2020. http://dx.doi.org/10.31812/123456789/4462.

Full text
Abstract:
The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by all popular browsers. The software product is provided with user registration and authorization functions, chat communication, personal cabinet editing and viewing the statistics on web- application use. An additional condition is taken into account at the design stage, namely the flexibility of the architecture, which envisaged the possibility of easy expansion of an existing functionality. Virtual laboratory is used at Kryvyi Rih National University to training students of specialty 121 Software Engineering in the disciplines “Algorithms and Data Structures” and “Discrete Structures”.
APA, Harvard, Vancouver, ISO, and other styles
10

Daniell, Robert E., and Jr. DMSP Sensor Fusion Auroral E-layer Algorithm: Functional Description. Fort Belvoir, VA: Defense Technical Information Center, August 1995. http://dx.doi.org/10.21236/ada299121.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Functional algorithms' 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