1182 search results - page 97 / 237 » Reducing the Overhead of Dynamic Analysis |
121
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
An efficient addressing scheme is necessary for auto-configuration and seamless communication in pervasive computing environments. In this paper, we propose an efficient and simple...
127
click to vote
LCPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The increased popularity of grid systems and cycle sharing across organizations requires scalable systems that provide facilities to locate resources, to be fair in the u...
141
Voted
IJCAI
2007
15 years 5 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
130
click to vote
CIIT
2004
15 years 4 months ago
2004
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
136
Voted
GLVLSI
2008
IEEE
2008
IEEE
Simultaneous optimization of memory configuration and code allocation for low power embedded systems
15 years 3 months ago
This paper proposes a hybrid memory architecture which consists of the following two regions; 1) a dynamic power conscious region which uses low Vdd and Vth and 2) a static power ...