Results 251 to 260 of about 8,312,092 (294)
Some of the next articles are maybe not open access.

Efficient Implementation of Separability Criteria

Journal of the Physical Society of Japan, 2003
Entanglement is a valuable resource in quantum information processing and thus its detection and characterization is an important procedure. We review some of the criteria for separability and provide an efficient and physically realizable method by which entanglement may be detected within the “distant labs” paradigm.
Oi, Daniel K. L., Christandl, Matthias
openaire   +2 more sources

An efficient mobile PACE implementation

Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security, 2011
Many future electronic identity cards will be equipped with a contact-less interface. Analysts expect that a significant proportion of future mobile phones support Near Field Communication (NFC) technology. Thus, it is a reasonable approach to use the cell phone as mobile smart card terminal, which in particular supports the Password Authenticated ...
Alexander Wiesmaier   +6 more
openaire   +2 more sources

Efficient implementation of adaptive software

ACM Transactions on Programming Languages and Systems, 1995
Adaptive programs compute with objects, just like object-oriented programs. Each task to be accomplished is specified by a so-called propagation pattern which traverses the receiver object. The object traversal is a recursive descent via the instance variables where information is collected or propagated along the way. A propagation pattern consists of
Jens Palsberg   +2 more
openaire   +1 more source

Evaluating the efficiency of Linda implementations

Concurrency and Computation: Practice and Experience, 2017
SummaryAmong the paradigms for parallel and distributed computing, the one popularized with Linda, and based on tuple spaces, is one of the least used, despite the fact of being intuitive, easy to understand, and easy to use. A tuple space is a repository, where processes can add, withdraw, or read tuples by means of atomic operations.
Vitaly Buravlev   +2 more
openaire   +2 more sources

An efficient implementation for coroutines

2005
Emulating coroutines with first-class continuations imposes an unacceptable overhead in managing function frames when there is an intensive exchange of control. This paper presents a high-performance implementation for a restricted class of continuations.
openaire   +2 more sources

An efficient implementation of online arithmetic

2016 International Conference on Field-Programmable Technology (FPT), 2016
We propose the first hardware implementation of standard arithmetic operators - addition, multiplication, and division - that utilises constant compute resource but allows numerical precision to be adjusted arbitrarily at run-time. Traditionally, precision must be set at design-time so that addition and multiplication, which calculate the least ...
Yiren Zhao   +2 more
openaire   +1 more source

Efficient implementation of narrowing and rewriting

2005
We present an efficient implementation method for a language that amalgamates functional and logic programming styles. The operational semantics of the language consists of resolution to solve predicates and narrowing and rewriting to evaluate functional expressions. The implementation is based on an extension of the Warren Abstract Machine (WAM). This
openaire   +2 more sources

An efficient implementation of trie structures

Software: Practice and Experience, 1992
AbstractA new internal array structure, called a double‐array, implementing a trie structure is presented. The double‐array combines the fast access of a matrix form with the compactness of a list form. The algorithms for retrieval, insertion and deletion are introduced through examples.
Jun-Ichi Aoe   +2 more
openaire   +2 more sources

Implementing an Efficient Java Interpreter

2001
The Java virtual machine (JVM) is usually implemented with an interpreter or just-in-time (JIT) compiler. JIT compilers provide the best performance, but must be substantially rewritten for each architecture they are ported to. Interpreters are easier to develop and maintain, and can be ported to new architectures with almost no changes.
David Gregg   +2 more
openaire   +1 more source

Efficient implementation of lattice operations

ACM Transactions on Programming Languages and Systems, 1989
Lattice operations such as greatest lower bound (GLB), least upper bound (LUB), and relative complementation (BUTNOT) are becoming more and more important in programming languages supporting object inheritance. We present a general technique for the efficient implementation of such operations based on an encoding method.
Hassan Aït-Kaci   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy