3223 search results - page 483 / 645 » The Scaling of Search Cost |
159
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
159
click to vote
HPDC
2009
IEEE
16 years 1 months ago
2009
IEEE
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
202
click to vote
CIG
2005
IEEE
16 years 4 days ago
2005
IEEE
Several attempts have been made in the past to construct encoding schemes that allow modularity to emerge in evolving systems, but success is limited. We believe that in order to c...
198
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
204
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Technology scaling has offered advantages to embedded systems, such as increased performance, more available memory and reduced energy consumption. However, scaling also brings a...