2745 search results - page 232 / 549 » A fast algorithm for computing large Fibonacci numbers |
132
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
162
click to vote
AI
2002
Springer
15 years 4 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
138
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
197
click to vote
TVLSI
2010
14 years 11 months ago
2010
Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memor...
147
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homo...