Sciweavers

710 search results - page 95 / 142
» On Minimum Power Connectivity Problems
Sort
View
109
Voted
DMGT
2011
94views more  DMGT 2011»
14 years 4 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
106
Voted
GLOBECOM
2006
IEEE
15 years 6 months ago
Topology Control for Simple Mobile Networks
— Topology control is the problem of assigning power levels to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumptio...
Liang Zhao, Errol L. Lloyd, S. S. Ravi
134
Voted
MOBIQUITOUS
2007
IEEE
15 years 6 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
90
Voted
TALG
2010
86views more  TALG 2010»
14 years 11 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
ASPDAC
2004
ACM
96views Hardware» more  ASPDAC 2004»
15 years 6 months 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