Sciweavers

2323 search results - page 9 / 465
» Power optimization for connectivity problems
Sort
View
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
13 years 11 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
MOBIQUITOUS
2007
IEEE
14 years 1 months ago
Optimal Relay Node Fault Recovery
—Topology control problems are concerned with the assignment of power levels to the nodes of an ad-hoc network so as to maintain a specified network topology while minimizing th...
Fei Che, Liang Zhao, Errol L. Lloyd
ASPDAC
2004
ACM
96views Hardware» more  ASPDAC 2004»
14 years 29 days ago
Register binding and port assignment for multiplexer optimization
- Data path connection elements, such as multiplexers, consume a significant amount of area on a VLSI chip, especially for FPGA designs. Multiplexer optimization is a difficult pro...
Deming Chen, Jason Cong
CPAIOR
2007
Springer
14 years 1 months ago
Connections in Networks: Hardness of Feasibility Versus Optimality
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
Jon Conrad, Carla P. Gomes, Willem Jan van Hoeve, ...
ICCAD
2008
IEEE
116views Hardware» more  ICCAD 2008»
14 years 4 months ago
Optimization-based framework for simultaneous circuit-and-system design-space exploration: a high-speed link example
—Connecting system-level performance models with circuit information has been a long-standing problem in analog/mixed-signal front-ends, like radios and high-speed links. High-sp...
Ranko Sredojevic, Vladimir Stojanovic