2745 search results - page 433 / 549 » A fast algorithm for computing large Fibonacci numbers |
133
click to vote
ISCA
2006
IEEE
15 years 10 months ago
2006
IEEE
We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and t...
165
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
124
click to vote
DEXAW
2004
IEEE
15 years 8 months ago
2004
IEEE
As the number of resources on the Grid tends to be very dynamic and potentially large, it becomes increasingly important to discover and monitor them efficiently. This paper conce...
137
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...
156
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...