2814 search results - page 181 / 563 » Competitive Analysis of Distributed Algorithms |
120
Voted
FTTCS
2006
15 years 25 days ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
DAC
2007
ACM
16 years 1 months ago
2007
ACM
Power gating is one of the most effective ways to reduce leakage power. In this paper, we introduce a new relationship among Maximum Instantaneous Current, IR drops and sleep tran...
109
Voted
ICPPW
2002
IEEE
15 years 5 months ago
2002
IEEE
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...
111
Voted
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
147
click to vote
ICML
1995
IEEE
16 years 1 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...