Sciweavers

710 search results - page 79 / 142
» On Minimum Power Connectivity Problems
Sort
View
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
14 years 9 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
ISCAS
1999
IEEE
82views Hardware» more  ISCAS 1999»
14 years 1 months ago
Synthesis of low coefficient sensitivity digital filters using genetic programming
This paper proposes a new approach to the synthesis of low coefficient sensitivity digital filters using Genetic Programming (GP). GP is applied to the synthesis problem by establi...
K. Uesaka, M. Kawamata
JSW
2008
158views more  JSW 2008»
13 years 9 months ago
Hybrid Wireless Mesh Network with Application to Emergency Scenarios
Establishing and accessing a reliable communication infrastructure at crisis site is a challenging research problem. Failure in communication infrastructure and information exchang...
Raheleh B. Dilmaghani, Ramesh R. Rao
JCT
2007
85views more  JCT 2007»
13 years 8 months ago
Avoider-Enforcer games
In numerous positional games the identity of the winner is easily determined. In this case one of the more interesting questions is not who wins but rather how fast can one win. T...
Dan Hefetz, Michael Krivelevich, Tibor Szabó...
MST
2010
107views more  MST 2010»
13 years 7 months ago
Fixed-Parameter Algorithms for Cluster Vertex Deletion
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
Falk Hüffner, Christian Komusiewicz, Hannes M...