Sciweavers

13376 search results - page 36 / 2676
» Problem Solving with
Sort
View
PKC
2010
Springer
199views Cryptology» more  PKC 2010»
14 years 11 months ago
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group opera...
Steven D. Galbraith, Raminder S. Ruprai
116
Voted
FPL
2006
Springer
208views Hardware» more  FPL 2006»
15 years 4 months ago
Implementation in Fpgas of Jacobi Method to Solve the Eigenvalue and Eigenvector Problem
This work shows a modular architecture based on FPGA's to solve the eigenvalue problem according to the Jacobi method. This method is able to solve the eigenvalues and eigenv...
Ignacio Bravo, Pedro Jiménez, Manuel Mazo, ...
93
Voted
CEC
2008
IEEE
15 years 7 months ago
Solving dynamic multi-objective problems with vector evaluated particle swarm optimisation
— Many optimisation problems are multi-objective and change dynamically. Many methods use a weighted average approach to the multiple objectives. This paper introduces the usage ...
Mardé Greeff, Andries Petrus Engelbrecht
TWC
2008
158views more  TWC 2008»
15 years 16 days ago
Solving Box-Constrained Integer Least Squares Problems
A box-constrained integer least squares problem (BILS) arises from several wireless communications applications. Solving a BILS problem usually has two stages: reduction (or prepro...
Xiao-Wen Chang, Qing Han
91
Voted
CORR
2007
Springer
76views Education» more  CORR 2007»
15 years 19 days ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean