Sciweavers

2563 search results - page 138 / 513
» Parallel matrix algorithms and applications
Sort
View
ICCAD
1997
IEEE
108views Hardware» more  ICCAD 1997»
15 years 8 months ago
Negative thinking by incremental problem solving: application to unate covering
We introduce a new technique to solve exactly a discrete optimization problem, based on the paradigm of “negative” thinking. The motivation is that when searching the space of...
Evguenii I. Goldberg, Luca P. Carloni, Tiziano Vil...
112
Voted
ICPADS
1998
IEEE
15 years 8 months ago
Fast Mutual Exclusion Algorithms Using Read-Modify-Write and Atomic Read/Write Registers
: Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last alg...
Ting-Lu Huang
IVC
2006
123views more  IVC 2006»
15 years 3 months ago
Multi-sector algorithm for hardware acceleration of the general Hough transform
The Multi-Sector Algorithm (MSA) is a simplification of the CORDIC algorithm to more closely meet the requirements for a real-time general Hough transform applications. The MSA ca...
Emeric K. Jolly, Martin Fleury
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
15 years 10 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
ISSAC
2009
Springer
150views Mathematics» more  ISSAC 2009»
15 years 10 months ago
On finding multiplicities of characteristic polynomial factors of black-box matrices
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...
Jean-Guillaume Dumas, Clément Pernet, B. Da...