134 search results - page 17 / 27 » A Memetic Algorithm for the Generalized Minimum Vertex-Bicon... |
ICALP
2003
Springer
14 years 22 days ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
MOBIHOC
2005
ACM
14 years 7 months ago
2005
ACM
Wireless Sensor and Actor Networks (WSANs) are composed of a large number of heterogeneous nodes called sensors and actors. The collaborative operation of sensors enables the dist...
DAC
2011
ACM
12 years 7 months ago
2011
ACM
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
IJFCS
1998
13 years 7 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...