1963 search results - page 274 / 393 » The Maximum Solution Problem on Graphs |
98
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper studies the problem of energy conservation of mobile terminals in a multi-cell TDMA network supporting real-time sessions. The corresponding optimization problem involv...
100
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
107
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
120
click to vote
SIGMETRICS
2008
ACM
15 years 17 days ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
ICCAD
2005
IEEE
15 years 9 months ago
2005
IEEE
Clustering (or partitioning) is a crucial step between logic synthesis and physical design in the layout of a large scale design. A design verified at the logic synthesis level m...