• Suche: "ACM: F.: Theory of Computation"

Treffer 141 - 160 von 1.806

141

Towards Corecursion Without Corecursion in Coq
Rusu, Vlad ; Nowak, David ; Analyse symbolique et conception orientée composants pour des systèmes embarqués temps-réel modulaires (SYCOMORES) ; et al.

ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.3.3: Studies of Progra... F.3.3.1: Functional cons... [INFO.INFO-SE]Computer S... Software Engineering [cs...
E-Ressource
Zu den Favoriten
142

A gentle introduction to Girard's Transcendental Syntax for the linear logician
Eng, Boris ; Laboratoire d'Informatique de Paris-Nord (LIPN) ; Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Realizability semantics Geometry of Interaction Semantics Linear Logic Models of Computation ACM: F.: Theory of Compu... …
E-Ressource
Zu den Favoriten
143

The dark side of financial dynamics: a Schumpeterian destructive creation process
Klapkiv, Lyubov ; Ülgen, Faruk ; Maria Curie-Sklodowska University (UMCS) ; et al.
Bank I Kredyt (Bank and Credit). 55(5):661-682

evolutionary economics creative destruction innovation regulation financial crises destructive creation …
Zeitschrift
Zu den Favoriten
144

Taylor Approximation and Infinitary λ-Calculi
Développement de Taylor et λ-calcul infinitaire
Cerda, Rémy ; Institut de Mathématiques de Marseille (I2M) ; Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS) ; et al.
Mathematics [math]. Aix-Marseille Université, 2024. English. ⟨NNT : 2024AIXM0148⟩

Lambda-calculus Mathematical logic Theoretical computer sci... Infinitary rewriting Program approximation Taylor expansion …
Dissertation
Zu den Favoriten
145

Short Note on P vs NP
Vega, Frank ; Joysonic

complexity classes graph completeness polynomial time ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... …
E-Ressource
Zu den Favoriten
146

Agafonov’s Proof of Agafonov’s Theorem: A Modern Account and New Insights
Seiller, Thomas ; Simonsen, Jakob, Grue ; Centre National de la Recherche Scientifique (CNRS) ; et al.

ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.3: Formal Languages [INFO.INFO-FL]Computer S... Formal Languages and Aut... [INFO.INFO-DM]Computer S... …
E-Ressource
Zu den Favoriten
147

Tameness and the power of programs over monoids in DA
Grosshans, Nathan ; McKenzie, Pierre ; Segoufin, Luc ; et al.

Programs over monoids Tameness DA Lower bounds ACM: F.: Theory of Compu... F.1: COMPUTATION BY ABST... …
E-Ressource
Zu den Favoriten
148

Approximation capability of two hidden layer feedforward neural networks with fixed weights
Guliyev, Namig ; Ismailov, Vugar ; Institute of Mathematics and Mechanics ; et al.
Neurocomputing. 316:262-269

multilayer feedforward n... hidden layer sigmoidal function activation function weight the Kolmogorov superposi... …
Zeitschrift
Zu den Favoriten
149

Relationship between superstring and compression measures: New insights on the greedy conjecture
Cazaux, Bastien ; Rivals, Eric ; Méthodes et Algorithmes pour la Bioinformatique (MAB) ; et al.
Discrete Applied Mathematics. 245:59-64

Approximation algorithm Shortest Common Superstr... Stringology Data compression Assembly Greedy conjecture …
Zeitschrift
Zu den Favoriten
150

The Complexity of Diagnosability and Opacity Verification for Petri Nets
Bérard, Béatrice ; Haar, Stefan ; Schmitz, Sylvain ; et al.
Fundamenta Informaticae. 161(4):317-349

Diagnosability Opacity Verification Complexity Petri nets ACM: D.: Software …
Zeitschrift
Zu den Favoriten
151

Zentralitätsmaßnahmen für die Evakuierung: so finden Sie agile Evakuierungsrouten
Centrality measures for evacuation: Finding agile evacuation routes
Medidas de centralidad para la evacuación. Cómo encontrar rutas de evacuación ágil
Mesures de centralité pour l'évacuation: comment trouver des itinéraires d'évacuation agiles
Misure di centralita per l'evacuazione. Come trovare percorsi di evacuazione agili
Lujak, Marin ; Giordani, Stefano ; Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Lille Douai) ; et al.
Future Generation Computer Systems. 83:401-412

ACM: I.: Computing Metho... I.2: ARTIFICIAL INTELLIG... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... …
Zeitschrift
Zu den Favoriten
152

Malleable task-graph scheduling with a practical speed-up model
Marchal, Loris ; Simon, Bertrand ; Sinnen, Oliver ; et al.
IEEE Transactions on Parallel and Distributed Systems. 29(6):1357-1370

malleable tasks task graph Scheduling proportional mapping approximation algorithms speedup model …
Zeitschrift
Zu den Favoriten
153

Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
Blin, Lélia ; Tixeuil, Sébastien ; Université d'Évry-Val-d'Essonne (UEVE) ; et al.
Distributed Computing. 31(2):139-166

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... ACM: D.: Software D.1: PROGRAMMING TECHNIQ... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Zeitschrift
Zu den Favoriten
154

Proving Formally a Field-Based FSSP Solution
Marquer, Yoann ; Maignan, Luidnel ; Yunès, Jean-Baptiste ; et al.
[Technical Report] Laboratoire d'Informatique Algorithmique: Fondements et Applications. :1-58

ACM: F.: Theory of Compu... [INFO.INFO-DS]Computer S... Data Structures and Algo... [INFO.INFO-FL]Computer S... Formal Languages and Aut... [MATH.MATH-LO]Mathematic... …
Report
Zu den Favoriten
155

On the approximation by single hidden layer feedforward neural networks with fixed weights
Guliyev, Namig, J ; Ismailov, Vugar, E ; Institute of Mathematics and Mechanics, Azerbaijan National Academy of Sciences ; et al.
Neural Networks. 98:296-304

sigmoidal function activation function feedforward neural netwo... weight hidden layer approximation …
Zeitschrift
Zu den Favoriten
156

Just-Right Consistency: reconciling availability and safety
La juste cohérence pour reconcilier disponibilité et sûreté
Shapiro, Marc ; Bieniusa, Annette ; Preguiça, Nuno ; et al.
[Research Report] RR-9145. :1-15

Distributed systems Iinvariants Distributed programming CAP Theorem Consistency Availability …
Report
Zu den Favoriten
157

Conferences WORDS, years 1997-2017: Open Problems and Conjectures
Néraud, Jean ; Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes (LITIS) ; Université Le Havre Normandie (ULH) ; et al.
Bulletin of Association for Theoretical Computer Science (BEATCS). 125:119-148

MSC 68R15 ACM: F.: Theory of Compu... ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... [INFO.INFO-CL]Computer S... Computation and Language... …
Zeitschrift
Zu den Favoriten
158

Expressing Additives Using Multiplicatives and Subexponentials
Chaudhuri, Kaustuv ; Proof search and reasoning with logic specifications (PARSIFAL) ; Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; et al.
Mathematical Structures in Computer Science. 28(5):651-666

ACM: F.: Theory of Compu... F.4: MATHEMATICAL LOGIC... F.4.1: Mathematical Logi... F.4.1.7: Proof theory F.4.3: Formal Languages F.4.3.3: Decision proble... …
Zeitschrift
Zu den Favoriten
159

Plugging-in Proof Development Environments using Locks in LF
Honsell, Furio ; Liquori, Luigi ; Maksimovic, Petar ; et al.
Mathematical Structures in Computer Science. 28(9):1578-1605

MSCS ACM: F.: Theory of Compu... F.3: LOGICS AND MEANINGS... F.4: MATHEMATICAL LOGIC... [INFO.INFO-CL]Computer S... Computation and Language... …
Zeitschrift
Zu den Favoriten
160

Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots
Balabonski, Thibaut ; Courtieu, Pierre ; Pelle, Robin ; et al.
[Research Report] Sorbonne Université. :1-12

ACM: C.: Computer System... C.2: COMPUTER-COMMUNICAT... ACM: D.: Software D.1: PROGRAMMING TECHNIQ... ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... …
Report
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter