182 search results - page 23 / 37 » Routing Tree Problems on Random Graphs |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
COCOA
2009
Springer
15 years 2 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
AINA
2010
IEEE
15 years 2 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
69
Voted
DAC
2006
ACM
15 years 10 months ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...