Sciweavers

3206 search results - page 158 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
CGO
2006
IEEE
15 years 9 months ago
A Self-Repairing Prefetcher in an Event-Driven Dynamic Optimization Framework
Software prefetching has been demonstrated as a powerful technique to tolerate long load latencies. However, to be effective, prefetching must target the most critical (frequently...
Weifeng Zhang, Brad Calder, Dean M. Tullsen
KCAP
2003
ACM
15 years 8 months ago
Using transformations to improve semantic matching
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 3 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 3 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
ATS
2001
IEEE
126views Hardware» more  ATS 2001»
15 years 6 months ago
Design of an Optimal Test Access Architecture Using a Genetic Algorithm
Test access is a major problem for core-based systemon-chip (SOC) designs. Since cores in an SOC are not directly accessible via chip inputs and outputs, special access mechanisms...
Zahra Sadat Ebadi, André Ivanov