Results 21 to 30 of about 1,174,960 (285)
Systems, 2017 Approaches for the design of fault tolerant Network-on-Chip (NoC) for use in System-on-Chip (SoC) reconfigurable technology using Field-Programmable Gate Array (FPGA) technology are challenging, especially in Multiprocessor System-on-Chip (MPSoC) design.
Hayat Daoud +4 more
doaj +1 more source
A short proof of the Buchstaber-Rees theorem [PDF]
, 2010 We give a short proof of the Buchstaber-Rees theorem concerning symmetric powers. The proof is based on the notion of a formal characteristic function of a linear map of algebras.Comment: 11 pages ...
H. M. Khudaverdian, Th, Th. Voronov
core +2 more sources
Formal Proofs for Nonlinear Optimization
Journal of Formalized Reasoning, 2014 We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified lower bound of $f$ over $K$.
Magron, Victor +3 more
openaire +7 more sources
Autarkic Computations in Formal Proofs
Journal of Automated Reasoning, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barendregt, H.P., Barendsen, E.
openaire +2 more sources
Tamarkins proof of Kontsevich formality theorem [PDF]
Forum Mathematicum, 2003 In 1998 D. Tamarkin announced a proof of Kontsevich formality theorem based on the existence of structure of homotopy Gerstenhaber algebra in the Hochschild cochains of an associative algebra. In this note we give a detailed explanation of Tamarkin's result.
openaire +2 more sources
Key Management in Wireless Sensor Networks
Journal of Sensor and Actuator Networks, 2015 Wireless sensor networks are a challenging field of research when it comes to security issues. Using low cost sensor nodes with limited resources makes it difficult for cryptographic algorithms to function without impacting energy consumption and latency.
Ismail Mansour +2 more
doaj +1 more source
Formal verification of a proof procedure for the description logic ALC [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Description Logics (DLs) are a family of languages used for the representation and reasoning on the knowledge of an application domain, in a structured and formal manner. In order to achieve this objective, several provers, such as RACER and FaCT++, have
Martin Strecker +2 more
doaj +1 more source
Formal Proof of SCHUR Conjugate Function
, 2010 The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie groups and symmetric functions. The core of the computations relies on enumeration and
A. Lascoux +8 more
core +3 more sources
Efficient Certified Resolution Proof Checking [PDF]
, 2016 We present a novel propositional proof tracing format that eliminates complex processing, thus enabling efficient (formal) proof checking. The benefits of this format are demonstrated by implementing a proof checker in C, which outperforms a state-of-the-
A Biere +29 more
core +3 more sources
, 2004 Formalized mathematics currently does not look much like informal mathematics. Also, formalizing mathematics currently seems far too much work to be worth the time of the working mathematician. To address both of these problems we introduce the notion of a formal proof sketch.
openaire +2 more sources