610 search results - page 100 / 122 » Solving Geometrical Place Problems by using Evolutionary Alg... |
135
Voted
FPGA
2003
ACM
15 years 8 months ago
2003
ACM
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
142
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—Wireless systems comprised of rechargeable nodes have a significantly prolonged lifetime and are sustainable. A distinct characteristic of these systems is the fact that the no...
128
Voted
IEEESCC
2009
IEEE
15 years 10 months ago
2009
IEEE
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
117
Voted
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
130
Voted
ISPD
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we develop a mixed-size placement tool, Dragon2005, to solve large scale placement problems effectively. A top-down hierarchical approach based on min-cut partition...