Sciweavers

1672 search results - page 20 / 335
» Tightness problems in the plane
Sort
View
ICCAD
1998
IEEE
66views Hardware» more  ICCAD 1998»
13 years 11 months ago
Tight integration of combinational verification methods
Combinational verification is an important piece of most equivalence checking tools. In the recent past, many combinational verification algorithms have appeared in the literature...
Jerry R. Burch, Vigyan Singhal
CATS
2006
13 years 9 months ago
On-demand Bounded Broadcast Scheduling with Tight Deadlines
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be ...
Chung Keung Poon, Feifeng Zheng, Yinfeng Xu
JSAC
2011
82views more  JSAC 2011»
13 years 2 months ago
Optimal Cognitive Access of Markovian Channels under Tight Collision Constraints
Abstract—The problem of cognitive access of channels of primary users by a secondary user is considered. The transmissions of primary users are modeled as independent continuous-...
Xin Li, Qianchuan Zhao, Xiaohong Guan, Lang Tong
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
14 years 7 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 7 months ago
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
David Peleg, Vitaly Rubinovich