Results 271 to 280 of about 7,435,185 (311)

Efficient parallel solution of linear systems

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85, 1985
The most efficient known parallel algorithms for inversion of a nonsingular n × n matrix A or solving a linear system Ax = b over the rationals require O(log n)2 time and M(n)n0.5 processors (where M(n) is the number of processors required in order to multiply two n × n rational matrices in time O(log n).) Furthermore, all known polylog time algorithms
Victor Y. Pan, John H. Reif
openaire   +2 more sources

Characterizing ϵ-properly efficient solutions

Optimization Methods and Software, 2014
In this paper, new necessary and sufficient conditions for characterizing ϵ-properly efficient solutions and new necessary conditions for characterizing ϵ-weakly efficient solutions of multiple objective optimization problems are presented. Note that all of the provided results are established without any convexity and boundedness assumptions on the ...
Kazhal Khaledian, Esmaile Khorram, Behrooz Karimi   +2 more
openaire   +1 more source

Major-efficient solutions and weakly major-efficient solutions of multiobjective programming

Applied Mathematics, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

An efficient RFID solution to expedite services

Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia, 2009
Radio Frequency Identification (RFID) is becoming attractive technology as an alternative to barcode systems. RFID systems provide an automatic identification method, relying on storing and remotely retrieving data using RFID tags or transponders. An RFID tag is an object that can be attached to or incorporated into a product, animal, or person for the
Tarek R. Sheltami, Elhadi M. Shakshuki
openaire   +1 more source

Efficient solutions for mapping parallel programs

1995
This paper describes a mapping toolbox, whose aim is to optimize the execution time of parallel programs described as task graphs on distributed memory parallel systems. The toolbox includes several classical mapping algorithms. It was assessed by computing the mapping of randomly generated task graphs and by mapping and executing on a parallel system ...
Pascal Bouvry, Jacques Chassin de Kergommeaux, Denis Trystram   +2 more
openaire   +1 more source

Efficiency Issues and Solutions in Blockchain: A Survey

2019
With the growing number of blockchain-based solutions in a few industries, we have moved to the next level of digital privacy. Meanwhile, several concerns related to transaction speed, data size, tracking information on public distributed ledgers faced to us. Time constraints and data overflow will lead to high financial expenses.
Atabaev Odiljon, Keke Gai
openaire   +1 more source

Approximately Efficient Solutions in Vector Optimization

Journal of Multi-Criteria Decision Analysis, 1996
Summary: An approach to approximating solutions in vector optimization is developed for vector optimization problems with arbitrary ordering cones. This paper presents a study of approximately efficient points of a given set with respect to a convex cone in an ordered Banach space. Existence results for such approximately efficient points are obtained.
openaire   +2 more sources

Efficient Solutions for a Problem in Currency Systems

2011
In this paper, an efficient recursive construction algorithm based on the backtracking search algorithm is presented for the construction of accurate implication sets. The new techniques suggested improve the time and space complexities of the backtracking search algorithm dramatically.
Xiaodong Wang 0003, Daxin Zhu
openaire   +2 more sources

An Efficient Solution for the Collusion Problem of DECO

2024 17th International Conference on Information Security and Cryptology (ISCTürkiye)
DECO is one of the state-of-The-Art TLS evidence protocols that enables privacy-preserving verification without necessitating server-side modifications. It allows applications to extract verifiable data from websites. However, DECO is vulnerable to collusion attacks, where the prover and verifier may secretly conspire, even if DECO itself remains ...
Uğur Şen, Murat Osmanoğlu, Ali Aydin Selçuk   +2 more
openaire   +2 more sources

Efficient linear solution of exterior orientation

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
This paper concerns an efficient algorithm for the solution of the exterior orientation problem. Orthogonal decompositions are used to first isolate the unknown depths of feature points in the camera reference frame, allowing the problem to be reduced to an absolute orientation with scale problem, which is solved using the singular value decomposition (
openaire   +2 more sources