Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge [PDF]
EPTCS 297, 2019, 2019 This is the proceedings of the Seventeenth conference on Theoretical Aspects of Rationality and Knowledge, 17-19 July 2019, Institut de Recherche en Informatique de Toulouse (IRIT), Toulouse University Toulouse, France. The mission of the TARK conferences is to bring together researchers from a wide variety of fields, including Artificial Intelligence,
arxiv +1 more source
Optimistic and Pessimistic Result of Planning and Scheduling Dynamic Processes [PDF]
Computer Science, 1999 The combinatorial optimization is aimed at finding the optimum sequence for a given form of the performance index. This paper deals with the problems of combinatorics optimization.
Wieslaw Wajs
doaj
Technical note: “Bit by bit”: a practical and general approach for evaluating model computational complexity vs. model performance [PDF]
Hydrology and Earth System Sciences, 2021 One of the main objectives of the scientific enterprise is the development of well-performing yet parsimonious models for all natural phenomena and systems.
E. Azmi +6 more
doaj +1 more source
Fragments of first-order logic over infinite words [PDF]
, 2008 We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic FO[
Diekert, Volker, Kufleitner, Manfred
core +6 more sources
Normal Functions as a New Way of Defining Computable Functions [PDF]
Computer Science, 2004 Report sets new method of defining computable functions. This is formalization of traditional function descriptions, so it allows to define functions in very intuitive way.
Leszek Dubiel
doaj
Computing Least Fixed Points of Probabilistic Systems of Polynomials [PDF]
, 2010 We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1.
Esparza, Javier +2 more
core +7 more sources
Generating Turing Machines by Use of Other Computation Models [PDF]
Computer Science, 2003 For each problem that can be solved there exists algorithm, which can be described with a program of Turing machine. Because this is very simple model programs tend to be very complicated and hard to analyse by human.
Leszek Dubiel
doaj
Pérenniser le patrimoine immatériel : un projet d’archivage logiciel mis en place par l’Aconit
Humanités Numériques, 2023 The article discusses the challenges of preserving software as part of the Association pour un conservatoire de l’informatique et de la télématique (Aconit), a French nonprofit organisation for heritage computer science. One major issue is the decreasing
Antoine Hébert, Xavier Hiron
doaj +1 more source
The tropical double description method [PDF]
, 2010 We develop a tropical analogue of the classical double description method allowing one to compute an internal representation (in terms of vertices) of a polyhedron defined externally (by inequalities).
Allamigeon, Xavier +2 more
core +5 more sources
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window [PDF]
, 2010 The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distributed data streams over a time-based sliding window (which contains a ...
Chan, Ho-Leung +3 more
core +3 more sources