434 search results - page 70 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
MDM
2009
Springer
15 years 4 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
101
click to vote
WIOPT
2010
IEEE
14 years 7 months ago
2010
IEEE
Scheduling of transmissions is one of the most fundamental problems in the context of wireless networks. In this article, we consider the problem of computing power efficient sched...
DAC
2008
ACM
15 years 10 months ago
2008
ACM
FPGA application developers often attempt to use pipelining, Cslowing and retiming to improve the performance of their designs. Unfortunately, such registered netlists present a f...
DAC
2008
ACM
15 years 10 months ago
2008
ACM
A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to differ...