Sciweavers

1408 search results - page 120 / 282
» Dynamical Tensor Approximation
Sort
View
CASES
2006
ACM
14 years 4 months ago
A dynamic code placement technique for scratchpad memory using postpass optimization
In this paper, we propose a fully automatic dynamic scratchpad memory (SPM) management technique for instructions. Our technique loads required code segments into the SPM on deman...
Bernhard Egger, Chihun Kim, Choonki Jang, Yoonsung...
INFOCOM
2003
IEEE
14 years 3 months ago
Modeling Malware Spreading Dynamics
— In this paper we present analytical techniques that can be used to better understand the behavior of malware, a generic term that refers to all kinds of malicious software prog...
Michele Garetto, Weibo Gong, Donald F. Towsley
ISCA
2002
IEEE
103views Hardware» more  ISCA 2002»
14 years 3 months ago
Efficient Dynamic Scheduling Through Tag Elimination
An increasingly large portion of scheduler latency is derived from the monolithic content addressable memory (CAM) arrays accessed during instruction wakeup. The performance of th...
Dan Ernst, Todd M. Austin
GECCO
2009
Springer
169views Optimization» more  GECCO 2009»
14 years 2 months ago
An ant based algorithm for task allocation in large-scale and dynamic multiagent scenarios
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating i...
Fernando dos Santos, Ana L. C. Bazzan
COCOON
2001
Springer
14 years 2 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup