Results 121 to 130 of about 557,042 (163)
Non-Parametric Kinematic Optimization of Flapping Foil Propulsion Using a Discrete Adjoint Method. [PDF]
Biomimetics (Basel)Yin Z, Zhou C, Wang X, Liao X, Wang J.
europepmc +1 more source
Space-time-coding metasurfaces for high-dimensional communications with OAM-, polarization-, and frequency-division multiplexing. [PDF]
Light Sci ApplZhang L, Cui TJ.
europepmc +1 more source
Hydrogen evolution electrocatalysts in high-fold degenerate topological semimetals with chiral structures. [PDF]
Commun ChemWang Y, Yu H, Xu Q, Liu W.
europepmc +1 more source
Landauer-Based Economic Temperature in Blockspace Markets: Evidence from Bitcoin and Ethereum. [PDF]
Entropy (Basel)Zouari M, Alon I, Shtudiner Z.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Information and Software Technology, 2004
Abstract XML is the future language for data exchange, and support for XML has been extensive. Although XML has numerous benefits including self-describing data, improved readability, and standardization, there are always tradeoffs in the introduction of new technologies that replace existing systems.
exaly +2 more sources
Abstract XML is the future language for data exchange, and support for XML has been extensive. Although XML has numerous benefits including self-describing data, improved readability, and standardization, there are always tradeoffs in the introduction of new technologies that replace existing systems.
exaly +2 more sources
Rocky Mountain Journal of Mathematics, 2023
The main result of the paper says that for each \(k\in N\) there exists a space-filling function \(f:[0,1]\to[0,1]^k\) such that \(f\) is at most \((k+1)-\mathrm{to} -1\) at each \(y\in[0,1]^k\) (which means that card \((f^{-1}(\{y\}))\leqslant k+1\) for each \(y\in[0,1]^k\)), \(f\) is exactly \((k+1)-\mathrm{to} -1\) at a countable dense subset of ...
Humke, Paul D. +2 more
openaire +1 more source
The main result of the paper says that for each \(k\in N\) there exists a space-filling function \(f:[0,1]\to[0,1]^k\) such that \(f\) is at most \((k+1)-\mathrm{to} -1\) at each \(y\in[0,1]^k\) (which means that card \((f^{-1}(\{y\}))\leqslant k+1\) for each \(y\in[0,1]^k\)), \(f\) is exactly \((k+1)-\mathrm{to} -1\) at a countable dense subset of ...
Humke, Paul D. +2 more
openaire +1 more source
Journal of Algorithms, 1998
Summary: We give first the representation of a suffix tree that uses \(n\lg n+ O(n)\) bits of space and supports searching for a pattern string in the given text (from a fixed size alphabet) in \(O(m)\) time, where \(n\) is the size of the text and \(m\) is the length of the pattern.
J. Ian Munro +2 more
openaire +1 more source
Summary: We give first the representation of a suffix tree that uses \(n\lg n+ O(n)\) bits of space and supports searching for a pattern string in the given text (from a fixed size alphabet) in \(O(m)\) time, where \(n\) is the size of the text and \(m\) is the length of the pattern.
J. Ian Munro +2 more
openaire +1 more source
2005
Ordered semantic hyper-linking (OSHL) is a first-order theorem prover that tries to take advantage of the speed of propositional theorem proving techniques. It instantiates first-order clauses to ground clauses, and applies propositional techniques to these ground clauses.
Swaha Miller, David A. Plaisted
openaire +1 more source
Ordered semantic hyper-linking (OSHL) is a first-order theorem prover that tries to take advantage of the speed of propositional theorem proving techniques. It instantiates first-order clauses to ground clauses, and applies propositional techniques to these ground clauses.
Swaha Miller, David A. Plaisted
openaire +1 more source
Space-efficient memo-functions
Journal of Systems and Software, 1996Abstract A number of memoisation techniques to eliminate computational redundancy from a large and automatically detectable class of nonlinear functions are introduced. The techniques make use of memo-tables and memo-functions to improve the run time efficiency of functions exhibiting commutative redundancy.
Hessam Khoshnevisan, Mohamad Afshar
openaire +1 more source
Space-efficient closure representations
Proceedings of the 1994 ACM conference on LISP and functional programming - LFP '94, 1994Many modern compilers implement function calls (or returns) in two steps: first, a closure environment is properly installed to provide access for free variables in the target program fragment; second, the control is transferred to the target by a “jump with arguments (or results)”. Closure conversion
Zhong Shao 0001, Andrew W. Appel
openaire +1 more source