1452 search results - page 125 / 291 » Algorithmic Analysis of Array-Accessing Programs |
CASES
2003
ACM
15 years 5 months ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
113
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
120
click to vote
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
120
click to vote
ATAL
2008
Springer
15 years 2 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
104
Voted
SC
2009
ACM
15 years 7 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...