Filtrer vos résultats
- 69
- 39
- 45
- 28
- 20
- 9
- 2
- 2
- 1
- 1
- 8
- 5
- 98
- 5
- 2
- 1
- 1
- 5
- 1
- 2
- 3
- 1
- 4
- 5
- 6
- 3
- 6
- 5
- 4
- 7
- 6
- 9
- 7
- 8
- 5
- 5
- 5
- 3
- 1
- 1
- 2
- 96
- 12
- 69
- 53
- 43
- 16
- 10
- 9
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 108
- 14
- 14
- 9
- 8
- 8
- 8
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
108 résultats
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures3rd IFIP International Conference on Theoretical Computer Science - TCS'2004, Aug 2004, Toulouse, France, 14 p
Communication dans un congrès
inria-00099896v1
|
|||
An analog Characterization of Elementarily Computable Functions Over the Real Numbers2nd APPSEM II Workshop - APPSEM'2004, 2004, Tallinn, Estonia, 12 p
Communication dans un congrès
inria-00099897v1
|
|||
On matrix mortality in low dimensionsV. Blondel, E. Sontag, M. Vidyasagar, J. Willems. Open Problems in Mathematical Systems Theory and Control, Springer-Verlag, pp.67-70, 1998
Chapitre d'ouvrage
inria-00108039v1
|
|||
On the mortality problem for matrices of low dimensions[Intern report] A00-R-089 || bournez00b, 2000
Rapport
inria-00099293v1
|
|||
|
|
Proving Positive Almost-Sure Termination16th International Conference on Rewriting Techniques and Applications - RTA'2005, Apr 2005, Nara/Japan, pp.323-337, ⟨10.1007/b135673⟩
Communication dans un congrès
inria-00000522v1
|
||
The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation3rd International Conference on Theory and Applications of Models of Computation - TAMC'2006, 2006, Pekin/Chine
Communication dans un congrès
inria-00102946v1
|
|||
Projet GasEl. Elaboration d'un logiciel de génération de mécanismes détaillés d'oxydation et de combustion de molécules d'hydrocarbures. Rapport No 2[Contrat] A02-R-559 || ibanescu02a, 2002, 26 p
Rapport
inria-00101047v1
|
|||
|
|
Computing with Large Populations Using InteractionsMathematical Foundations of Computer Science 2012, MFCS'2012, Aug 2012, Slovakia. pp.234-246
Communication dans un congrès
hal-00760669v1
|
||
|
|
Towards an Axiomatization of Simple Analog AlgorithmsTheory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings, Date-Added = 2012-05-04 20:32:53 +0000, Date-Modified = 2012-05-04 20:35:01 +0000, 2012, China. pp.525-536
Communication dans un congrès
hal-00760736v1
|
||
|
|
A Survey on Analog Models of ComputationHandbook of Computability and Complexity in Analysis, Springer International Publishing, pp.173-226, 2021, Theory and Applications of Computability, ⟨10.1007/978-3-030-59234-9_6⟩
Chapitre d'ouvrage
hal-04303956v1
|
||
Theoretical Computer Science: Computational ComplexityA Guided Tour of Artificial Intelligence Research - Volume III: Interfaces and Applications of Artificial Intelligence (10.1007/978-3-030-06170-8), Springer International Publishing, 2020
Chapitre d'ouvrage
hal-02995771v1
|
|||
Reachability Problems14235, Springer Nature Switzerland, 2023, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-45286-4⟩
Proceedings/Recueil des communications
hal-04303905v1
|
|||
|
|
Proving Positive Almost Sure Termination Under Strategies17th International Conference on Rewriting Techniques and Applications - RTA'2006, Aug 2006, Seattle, WA/USA, pp.357--371, ⟨10.1007/11805618⟩
Communication dans un congrès
inria-00102945v1
|
||
|
|
On the functions generated by the general purpose analog computerInformation and Computation, 2017, 257, pp.34-57. ⟨10.1016/j.ic.2017.09.015⟩
Article dans une revue
hal-04303984v1
|
||
|
|
Implicit Complexity over an Arbitrary Structure: Quantifier Alternations[Intern report] A04-R-300 || bournez04e, 2004, 23 p
Rapport
inria-00107811v1
|
||
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms14th International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.30-45
Communication dans un congrès
inria-00099621v1
|
|||
|
|
A dynamic approach for load balancingThe Third International Workshop on Game Theory in Communication Networks - GAMECOMM 2009, Samson Lasaulce and Yezekael Hayel, Oct 2009, Pise, Italy
Communication dans un congrès
inria-00435160v1
|
||
Population Protocols that Correspond to Symmetric GamesInternational Journal of Unconventional Computing, 2013, 9 (1-2), pp.5--36
Article dans une revue
hal-01198889v1
|
|||
|
|
A Survey on Continuous Time ComputationsNew Computational Paradigms. Changing Conceptions of What is Computable, Springer, pp.383-423, 2008
Chapitre d'ouvrage
hal-00760976v1
|
||
|
|
Polynomial differential equations compute all real computable functions on computable compact intervalsJournal of Complexity, 2007, 23 (3), pp.317--335
Article dans une revue
inria-00102947v2
|
||
|
|
Using local planar geometric invariants to match and model images of line segmentsComputer Vision and Image Understanding, 1998, 69 (2), pp.135-155. ⟨10.1006/cviu.1997.0565⟩
Article dans une revue
istex
inria-00102944v1
|
||
La revanche du calcul analogiqueLa revanche du calcul analogique, 2019, https://www.lemonde.fr/blog/binaire/2019/02/15/la-revanche-du-calcul-analogique/
Autre publication scientifique
hal-04487420v1
|
|||
|
|
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations9th International Conference MCU (Machines, Computations, and Universality ), Aug 2022, Debrecen, Hungary. pp.58-74, ⟨10.1007/978-3-031-13502-6_4⟩
Communication dans un congrès
hal-04259376v1
|
||
|
|
Solving Analytic Differential Equations in Polynomial Time over Unbounded DomainsMathematical Foundations of Computer Science, MFCS'11, 2011, Poland. pp.170-181
Communication dans un congrès
hal-00760919v1
|
||
Recursive Analysis Characterized as a Class of Real Recursive FunctionsFundamenta Informaticae, 2006, 74 (4), pp.409-433
Article dans une revue
inria-00000515v1
|
|||
|
|
A Universal Ordinary Differential EquationLogical Methods in Computer Science, 2020, 16 (1), ⟨10.23638/LMCS-16(1:28)2020⟩
Article dans une revue
hal-03011133v1
|
||
|
|
On the complexity of bounded time and precision reachability for piecewise affine systemsTheoretical Computer Science, 2018, 735, pp.132-146. ⟨10.1016/j.tcs.2016.09.021⟩
Article dans une revue
hal-04303982v1
|
||
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial TimeFoundations of Software Science and Computation Structures - FOSSACS'03, Apr 2003, Warsaw, Poland, pp.185-199
Communication dans un congrès
inria-00099618v1
|
|||
Safe Recursion and Calculus over an Arbitrary StructureImplicit Computational Complexity - ICC'2002, Jul 2002, Copenhagen, Denmark, 12 p
Communication dans un congrès
inria-00100884v1
|
|||
Rewriting Logic and Probabilities14th International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.61-75
Communication dans un congrès
inria-00099620v1
|