Academic literature on the topic 'Ideal Computing'

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 'Ideal Computing.'

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 "Ideal Computing"

1

Sreeramana, Aithal, and Pai T. Vaikunth. "Opportunity for Realizing Ideal Computing System using Cloud Computing Model." International Journal of Case Studies in Business, IT and Education (IJCSBE) 1, no. 2 (2017): 60–71. https://doi.org/10.5281/zenodo.1094995.

Full text
Abstract:
An ideal computing system is a computing system with ideal characteristics. The major components and their performance characteristics of such hypothetical system can be studied as a model with predicted input, output, system and environmental characteristics using the identified objectives of computing which can be used in any platform, any type of computing system, and for application automation, without making modifications in the form of structure, hardware, and software coding by an external user. In this paper, we have proposed cloud computing service model to be used as a part of comput
APA, Harvard, Vancouver, ISO, and other styles
2

Keppens, R., and J. W. S. Blokland. "Computing Ideal Magnetohydrodynamic Equilibria." Fusion Science and Technology 49, no. 2T (2006): 131–38. http://dx.doi.org/10.13182/fst06-a1112.

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

Dung, P. M., P. Mancarella, and F. Toni. "Computing ideal sceptical argumentation." Artificial Intelligence 171, no. 10-15 (2007): 642–74. http://dx.doi.org/10.1016/j.artint.2007.05.003.

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

AL-AYYOUB, IBRAHIM. "AN ALGORITHM FOR COMPUTING THE RATLIFF–RUSH CLOSURE." Journal of Algebra and Its Applications 08, no. 04 (2009): 521–32. http://dx.doi.org/10.1142/s0219498809003473.

Full text
Abstract:
Let I ⊂ K[x, y] be a 〈x, y〉-primary monomial ideal where K is a field. This paper produces an algorithm for computing the Ratliff–Rush closure Ĩ for the ideal I = 〈m0, …, mn〉 whenever mi is contained in the integral closure of the ideal 〈xan, yb0〉. This generalizes of the work of Crispin [2]. Also, it provides generalizations and answers for some questions given in [6], and enables us to construct infinite families of Ratliff–Rush ideals.
APA, Harvard, Vancouver, ISO, and other styles
5

Sadik, Brahim. "Computing Characteristic Sets of Ordinary Radical Differential Ideals." gmj 13, no. 3 (2006): 515–27. http://dx.doi.org/10.1515/gmj.2006.515.

Full text
Abstract:
Abstract We give upper bounds for the order of the elements in a characteristic set of a regular differential ideal or a radical of a finitely generated differential ideal with respect to some specific orderings. We then show how to compute characteristic sets of these ideals using algebraic methods.
APA, Harvard, Vancouver, ISO, and other styles
6

Creado, Orhio Mark, Bala Srinivasan, Phu Dung Le, and Jeff Tan. "The Ideal Computing System Framework – A Novel Security Paradigm." SIJ Transactions on Computer Science Engineering & its Applications (CSEA) 02, no. 04 (2014): 94–103. http://dx.doi.org/10.9756/sijcsea/v2i4/0203270402.

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

Hashemi, Amir, Martin Kreuzer, and Samira Pourkhajouei. "Computing all border bases for ideals of points." Journal of Algebra and Its Applications 18, no. 06 (2019): 1950102. http://dx.doi.org/10.1142/s0219498819501020.

Full text
Abstract:
In this paper, we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context, two different approaches are discussed: based on the Buchberger–Möller Algorithm [H. M. Möller and B. Buchberger, The construction of multivariate polynomials with preassigned zeros, EUROCAM ’82 Conf., Computer Algebra, Marseille/France 1982, Lect. Notes Comput. Sci. 144, (1982), pp. 24–31], we first propose a new algorithm to compute all possible order ideals and the correspondi
APA, Harvard, Vancouver, ISO, and other styles
8

Heuberger, Clemens, and Roswitha Rissner. "Computing J-ideals of a matrix over a principal ideal domain." Linear Algebra and its Applications 527 (August 2017): 12–31. http://dx.doi.org/10.1016/j.laa.2017.03.028.

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

Smith, N. P. "Janus: The Ideal Patron For Computing." Computing in Science and Engineering 2, no. 6 (2000): 106–7. http://dx.doi.org/10.1109/mcise.2000.881714.

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

Bouziane, Driss, and Abdelilah Kandri Rody. "On the resolvent of an ideal and some applications." International Journal of Mathematics and Mathematical Sciences 2003, no. 70 (2003): 4421–34. http://dx.doi.org/10.1155/s0161171203205378.

Full text
Abstract:
We give an algorithm to compute a resolvent of an algebraic variety without computing its irreducible components; we decompose the radical of an ideal into prime ideals and we test the primality of a regular ideal.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Ideal Computing"

1

Gustafsson, Thomas. "Computing The Ideal Racing Line Using Optimal Control." Thesis, Linköping University, Department of Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-11544.

Full text
Abstract:
<p>In racing, it is useful to analyze vehicle performance and driving strategies to achieve the best result possible in competitions. This is often done by simulations and test driving.</p><p>In this thesis optimal control is used to examine how a racing car should be driven to minimize the lap time. This is achieved by calculating the optimal racing line at various tracks. The tracks can have arbitrary layout and consist of corners with non-constant radius. The road can have variable width. A four wheel vehicle model with lateral and longitudinal weight transfer is used.</p><p>To increase the
APA, Harvard, Vancouver, ISO, and other styles
2

Ford, Andrew J. "LowPy: Simulation Platform for Machine Learning Algorithm Realization in Neuromorphic RRAM-Based Processors." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1617105323741119.

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

Silvestri, Francesco. "Oblivious Computations on Memory and Network Hierarchies." Doctoral thesis, Università degli studi di Padova, 2009. http://hdl.handle.net/11577/3426414.

Full text
Abstract:
The hierarchical organization of the memory and communication systems and the availability of numerous processing units play an important role in the performance of algorithms. Their actual exploitation is made hard by the different configurations they may assume. It is crucial, for economical and portability issues, that algorithms adapt to a wide spectrum of executing platforms, possibly in an automatic fashion. Adaptivity can be achieved through either aware algorithms, which make explicit use of suitable architectural parameters, or oblivious algorithms, whose sequence of operations is ind
APA, Harvard, Vancouver, ISO, and other styles
4

Yan, Baoqiang. "IDEA- an API for parallel computing with large spatial datasets /." Full text available from ProQuest UM Digital Dissertations, 2009. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1913289471&SrchMode=1&sid=5&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1278440146&clientId=22256.

Full text
Abstract:
Thesis (Ph.D.)--University of Mississippi, 2009.<br>Typescript. Vita. "July 2009." Committee chair: Philip J. Rhodes Includes bibliographical references (leaves 91-96). Also available online via ProQuest to authorized users.
APA, Harvard, Vancouver, ISO, and other styles
5

Khanolkar, Neeraj Suhas. "Asynchronous stigmergic sorting of binary matrix patterns applications of classical distributed computing ideas /." [Ames, Iowa : Iowa State University], 2009. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1473225.

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

Nygård, Moa. "Digitalt verktyg för kollaborativ idégenerering : Jämförelse mellan klassisk webbprogrammering och implementering mot molnplattform." Thesis, Mittuniversitetet, Institutionen för informationssystem och –teknologi, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-42926.

Full text
Abstract:
Den här studien har genomförts i samarbete med Statens tjänstepensionsverk (SPV). Myndigheten hanterar tjänstepensioner för de som är, eller har varit, statligt anställda. Studiens syfte var att utveckla ett användbart hjälpmedel för kollaborativ idégenerering samt att jämföra en implementation med traditionell webbprogrammering mot att skapa ett tillägg till en molnplattform. Metoder som användes i projektet var intervjuer med medarbetare på myndigheten, utveckling av en webbsida med HTML, CSS, JavaScript och PHP och utveckling av ett tillägg mot en molnplattform. Den framtagna prototypen av
APA, Harvard, Vancouver, ISO, and other styles
7

李承修. "An Application of Groebner Bases and Corner Elements : Computing Colon Ideals." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/26355594140942352861.

Full text
Abstract:
碩士<br>國立臺灣師範大學<br>數學系<br>101<br>For every even integer n=2k, let q_n be the ideal <x^{2n},y^{2n},(xy+z^2)^n,z^n> in the polynomial ring R=Q[x,y,z]. In her master's thesis [Y], Yao gives a Groebner basis G for q_n and proves that q_n+I_n contain in (q_n:m), where m is the maximal ideal <x,y,z> of R and I_n is the monomial ideal (x^k)(y^k)(z^{2k-1})<x^{2k},y^{2k}><x,y>^{k-1} of R. In this thesis, we prove that (q_n:m) and q_n+I_n are indeed equal. In the process of proving this equality, we give a Groebner basis for the ideals q_n+I_n and find the corner elements of the monomial ideal <LM(q_n)>.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Ideal Computing"

1

IDEAL 2010 (2010 Paisley, Scotland). Intelligent data engineering and automated learning-- IDEAL 2010: 11th international conference, Paisley, UK, September 1-3, 2010 : proceedings. Springer, 2010.

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

Zadeh, Lotfi A. Computing with Words: Principal Concepts and Ideas. Springer Berlin Heidelberg, 2012.

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

Savage, John E. The mystical machine: Issues and ideas in computing. Addison-Wesley, 1986.

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

ACADIA '95 (1995 Seattle, Wash.). Computing in design: Enabling, capturing and sharing ideas : ACADIA '95. Edited by Kalisperis Loukas, Kolarevic Branko, and Association for Computer-Aided Design in Architecture. Association for Computer Aided Design in Architecture], 1995.

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

University, Open, ed. Mathematics and computing: A level 3 course : Linear programming : the basic ideas. : the basic ideas. Open University, 2002.

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

Tangney, Brendan. Some ideas on support for fault tolerance in COMANDOS, an object oriented distributed system. Trinity College, Department of Computer Science, 1991.

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

Mary, Hamm, ed. Electronic learning: Issues and teaching ideas for educational computing, television, and visual literacy. Thomas, 1987.

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

Cappellini, Vito, ed. Electronic Imaging & the Visual Arts. EVA 2012 Florence. Firenze University Press, 2012. http://dx.doi.org/10.36253/978-88-6655-130-0.

Full text
Abstract:
The key aim of this Event is to provide a forum for the user, supplier and scientific research communities to meet and exchange experiences, ideas and plans in the wide area of Culture &amp; Technology. Participants receive up to date news on new EC and international arts computing &amp; telecommunications initiatives as well as on Projects in the visual arts field, in archaeology and history. Working Groups and new Projects are promoted. Scientific and technical demonstrations are presented.
APA, Harvard, Vancouver, ISO, and other styles
9

Association for Computer Aided Design in Architecture. Conference. Computingin design: Enabling, capturing and sharing ideas : University of Washington, Seattle, Washington, October 19-22, 1995. Edited by Kalisperis Loukas 1958- and Kolarevic Branko 1963-. Association for Computer Aided Design in Architecture, 1995.

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

Ng, Kia, Atta Badii, and Pierfrancesco Bellini, eds. Axmedis 2006. Proceedings of the 2nd International Conference on Automated Production of Cross Media Content for Multi-channel Distribution. Volume for Workshops, Tutorials, Applications and Industrial (Leeds, UK, 13-15 December 2006). Firenze University Press, 2006. http://dx.doi.org/10.36253/88-8453-525-5.

Full text
Abstract:
The AxMEDIS 2006 International Conference seeks to promote discussion and exchange of ideas amongst researchers, practitioners, developers and users of tools, technology transfer experts, and project managers. This conference series brings together a variety of participants from the academic, business and industrial worlds, to address the emergent research and technological issues as well as the engineering and commercial challenges of large-scale collaborative production and distribution of media as experienced by the associated industrial sectors in the emergent media markets. The conference
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Ideal Computing"

1

Prasad, Archana K., and S. S. Thakur. "s-Regularity Via Soft Ideal." In Soft Computing and Optimization. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-6406-0_7.

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

Garcia Bravo, Esteban, and Tim McGraw. "Visualizing Aldo Giorgini’s Ideal Flow." In Advances in Visual Computing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-27863-6_72.

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

Liang, Shaohui. "Ideal-Convergence in Quantales." In Advances in Intelligent and Soft Computing. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22833-9_84.

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

Fernández, M. J., M. Carro, and M. Hermenegildo. "IDRA (ideal resource allocation): Computing ideal speedups in parallel logic programming." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0024769.

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

Kelly, Stephen, and Khurshid Ahmad. "Sentiment Proxies: Computing Market Volatility." In Intelligent Data Engineering and Automated Learning - IDEAL 2012. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32639-4_91.

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

Sarath, Greeshma, S. Deepu, Sudharsan Sundararajan, and Krishnashree Achuthan. "ESEC: An Ideal Secret Sharing Scheme." In Advances in Intelligent Systems and Computing. Springer India, 2014. http://dx.doi.org/10.1007/978-81-322-2012-1_15.

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

Dhand, Harsh, and Lakshmi Pavan Daggubati. "Towards Obtaining an Ideal Real Time Panoramic Video." In Advances in Visual Computing. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11919629_70.

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

Rojas, Alejandro, René Cumplido, J. Ariel Carrasco-Ochoa, Claudia Feregrino, and J. Francisco Martínez-Trinidad. "FPGA-Based Architecture for Computing Testors." In Intelligent Data Engineering and Automated Learning - IDEAL 2007. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-77226-2_20.

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

Anderson, David V., W. Anthony Cooper, Ralf Gruber, Silvio Merazzi, and Ulrich Schwenn. "TERPSICHORE: A Three-Dimensional Ideal Magnetohydrodynamic Stability Program." In Scientific Computing on Supercomputers II. Springer US, 1990. http://dx.doi.org/10.1007/978-1-4613-0659-7_8.

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

Martins, Weber, Lauro Eugênio Guimarães Nalini, Marco Antonio Assfalk de Oliveira, and Leonardo Guerra de Rezende Guedes. "Soft Computing in Context-Sensitive Multidimensional Ranking." In Intelligent Data Engineering and Automated Learning – IDEAL 2006. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11875581_163.

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

Conference papers on the topic "Ideal Computing"

1

Khetarpaul, Sonia, Dolly Sharma, Saurabh Mishra, Shambhavi Sud, Pranav Soni, and Madhav Agarwal. "Location-Based Ideal Site Selection using Clustering." In 2024 IEEE International Conference on Contemporary Computing and Communications (InC4). IEEE, 2024. http://dx.doi.org/10.1109/inc460750.2024.10649092.

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

Begliarbekov, Milan, Yong Meng Sua, Yichen Ma, et al. "Thin film lithium niobate: the ideal material for quantum technologies." In Quantum Computing, Communication, and Simulation V, edited by Philip R. Hemmer and Alan L. Migdall. SPIE, 2025. https://doi.org/10.1117/12.3045085.

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

Fathi, Mostafa, Walid Gomaa, Yasutaka Wada, Keiji Kimura, Kazunori Ueda, and Ahmed El-Mahdy. "Ideal Parametrisation Estimation for Variational Quantum Circuit Classifiers Using Machine Learning." In 2024 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2024. https://doi.org/10.1109/qce60285.2024.10263.

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

Suseela, M. Sri Uma, V. Praveena, N. D. N. Lakshmi, M. Hemalatha, and Vusse Sandeep Kumar. "Advanced Cross-Layer Protocol Architecture through Modified Ideal Link State Routing (MOLSR)." In 2024 7th International Conference on Contemporary Computing and Informatics (IC3I). IEEE, 2024. https://doi.org/10.1109/ic3i61595.2024.10828909.

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

Goina, Dacian. "Ideal Centroid Striving: An Unsupervised and Prediction Parameterized Anomaly Detection Method." In 2024 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2024. https://doi.org/10.1109/synasc65383.2024.00039.

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

P, Kumar, Senthil Pandi S, Bharath Kumar L, and Karthick R. "Deep Reinforcement Learning-Based Precision Irrigation for Ideal Water Use in Arid Areas." In 2025 International Conference on Computing and Communication Technologies (ICCCT). IEEE, 2025. https://doi.org/10.1109/iccct63501.2025.11019921.

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

Alrabiah, Omar, Prabhanjan Ananth, Miranda Christ, Yevgeniy Dodis, and Sam Gunn. "Ideal Pseudorandom Codes." In STOC '25: 57th Annual ACM Symposium on Theory of Computing. ACM, 2025. https://doi.org/10.1145/3717823.3718309.

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

Lasserre, Jean, Monique Laurent, and Philipp Rostalski. "Computing the real variety of an ideal." In the 2008 ACM symposium. ACM Press, 2008. http://dx.doi.org/10.1145/1363686.1364131.

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

Hillis, W. Daniel. "Optical Computer Architecture: What is the Ideal?" In Optical Computing. Optica Publishing Group, 1987. http://dx.doi.org/10.1364/optcomp.1987.md1.

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

Jayanti, Prasad, Siddhartha Jayanti, and Sucharita Jayanti. "Towards an Ideal Queue Lock." In ICDCN 2020: 21st International Conference on Distributed Computing and Networking. ACM, 2020. http://dx.doi.org/10.1145/3369740.3369784.

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

Reports on the topic "Ideal Computing"

1

Pasupuleti, Murali Krishna. 2D Quantum Materials for Next-Gen Semiconductor Innovation. National Education Services, 2025. https://doi.org/10.62311/nesx/rrvi425.

Full text
Abstract:
Abstract The emergence of two-dimensional (2D) quantum materials is revolutionizing next-generation semiconductor technology, offering superior electronic, optical, and quantum properties compared to traditional silicon-based materials. 2D materials, such as graphene, transition metal dichalcogenides (TMDs), hexagonal boron nitride (hBN), and black phosphorus, exhibit high carrier mobility, tunable bandgaps, exceptional mechanical flexibility, and strong light-matter interactions, making them ideal candidates for ultra-fast transistors, spintronics, optoelectronic devices, and quantum computin
APA, Harvard, Vancouver, ISO, and other styles
2

Peisert, Sean, Thomas E. Potok, and Todd Jones. ASCR Cybersecurity for Scientific Computing Integrity - Research Pathways and Ideas Workshop. Office of Scientific and Technical Information (OSTI), 2015. http://dx.doi.org/10.2172/1236181.

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

Baader, Franz, and Rafael Peñaloza. Axiom Pinpointing in General Tableaux. Aachen University of Technology, 2007. http://dx.doi.org/10.25368/2022.159.

Full text
Abstract:
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a partic
APA, Harvard, Vancouver, ISO, and other styles
4

Baader, Franz, and Rafael Peñaloza. Pinpointing in Terminating Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.166.

Full text
Abstract:
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing minimal (maximal) subsets of the knowledge base that have (do not have) the consequence in question. The pinpointing algorithms described in the DL literature are obtained as extensions of the standard tableau-based reasoning algorithms for computing consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a partic
APA, Harvard, Vancouver, ISO, and other styles
5

Baader, Franz, and Rafael Peñaloza. Blocking and Pinpointing in Forest Tableaux. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.165.

Full text
Abstract:
Axiom pinpointing has been introduced in description logics (DLs) to help the used understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in consideration. Several pinpointing algorithms have been described as extensions of the standard tableau-based reasoning algorithms for deciding consequences from DL knowledge bases. Although these extensions are based on similar ideas, they are all introduced for a particular tableau-based algorithm for a particular DL, using specific traits of them. In the past, we have developed a genera
APA, Harvard, Vancouver, ISO, and other styles
6

Baader, Franz, and Francesco Kriegel. Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs: Extended Version. Technische Universität Dresden, 2022. http://dx.doi.org/10.25368/2022.131.

Full text
Abstract:
Ontologies based on Description Logic (DL) represent general background knowledge in a terminology (TBox) and the actual data in an ABox. DL systems can then be used to compute consequences (such as answers to certain queries) from an ontology consisting of a TBox and an ABox. Since both human-made and machine-learned data sets may contain errors, which manifest themselves as unintuitive or obviously incorrect consequences, repairing DL-based ontologies in the sense of removing such unwanted consequences is an important topic in DL research. Most of the repair approaches described in the liter
APA, Harvard, Vancouver, ISO, and other styles
7

Eparkhina, Dina. EuroSea Legacy Report. EuroSea, 2023. http://dx.doi.org/10.3289/eurosea_d8.12.

Full text
Abstract:
EuroSea is a holistic large-scale project encompassing the full value chain of marine knowledge, from observations to modelling and forecasting and to user-focused services. This report summarizes the legacy of EuroSea as planned and measured through a dedicated impact monitoring protocol, a holistic assessment of the project's successes in advancing and integrating European ocean observing and forecasting systems. Since its start, EuroSea has been analysing how well the project progresses towards the identified areas of impact. Impact assessment is not performance evaluation. These terms over
APA, Harvard, Vancouver, ISO, and other styles
8

Powerful Learning with Computational Thinking: Our Why, What, and How of Computational Thinking. Digital Promise, 2021. http://dx.doi.org/10.51388/20.500.12265/115.

Full text
Abstract:
The Powerful Learning with Computational Thinking report explains how the Digital Promise team works with districts, schools, and teachers to make computational thinking ideas more concrete to practitioners for teaching, design, and assessment. We describe three powerful ways of using computers that integrate well with academic subject matter and align to our goals for students: (1) collecting, analyzing, and communicating data; (2) automating procedures and processes; and (3) using models to understand systems. We also explore our four main commitments to computational thinking at Digital Pro
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!