7648 search results - page 841 / 1530 » A Data Locality Optimizing Algorithm |
210
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
161
click to vote
CDC
2009
IEEE
16 years 5 days ago
2009
IEEE
— Consider multiple sensors that transmit data over analog erasure links to an estimation center. The sensors have access to distinct entries of the output vector of a linear and...
216
click to vote
ASPDAC
2005
ACM
16 years 1 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
226
click to vote
AIA
2007
15 years 9 months ago
2007
Designers aim at fast but low-power consuming integrated circuits. Since high processing speed always comes with high energy demands, the literature provides several ways to reduc...
183
click to vote
SIROCCO
2007
15 years 9 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...