1578 search results - page 117 / 316 » Direct Routing: Algorithms and Complexity |
EVOW
2003
Springer
14 years 2 months ago
2003
Springer
Evolutionary Algorithms (EAs) have been proposed as a very powerful heuristic optimization technique to solve complex problems. Many case studies have shown that they work very eff...
CAINE
2003
13 years 10 months ago
2003
Scan based or Line Sweep methods are a traditional mechanism to traverse the physical layout, or artwork of a microchip. These traversals are incremental in nature. They typically...
TPDS
2008
13 years 8 months ago
2008
Power consumption is an important issue for cluster supercomputers as it directly affects running cost and cooling requirements. This paper investigates the memory energy efficienc...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
NETCOOP
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. In this paper we show how dynamic brokering for batch allocation in grids based on bi-dimensional indices can be used in practice in computational grids, with or without ...