Sciweavers

12194 search results - page 2250 / 2439
» Numberings Optimal for Learning
Sort
View
CASES
2004
ACM
16 years 1 hour ago
Procedure placement using temporal-ordering information: dealing with code size expansion
Abstract— In a direct-mapped instruction cache, all instructions that have the same memory address modulo the cache size, share a common and unique cache slot. Instruction cache ...
Christophe Guillon, Fabrice Rastello, Thierry Bida...
MSWIM
2004
ACM
15 years 12 months ago
Mobile dynamic content distribution networks
Mobile networks are becoming increasingly popular as a means for distributing information to a large number of users. In comparison to wired networks, mobile networks are distingu...
Wagner Moro Aioffi, Geraldo Robson Mateus, Jussara...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 12 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
ILP
2004
Springer
15 years 12 months ago
A Monte Carlo Study of Randomised Restarted Search in ILP
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
Filip Zelezný, Ashwin Srinivasan, David Pag...
CGO
2003
IEEE
15 years 12 months ago
Dynamic Binary Translation for Accumulator-Oriented Architectures
A dynamic binary translation system for a co-designed virtual machine is described and evaluated. The underlying hardware directly executes an accumulator-oriented instruction set...
Ho-Seop Kim, James E. Smith
« Prev « First page 2250 / 2439 Last » Next »