Sciweavers

3591 search results - page 602 / 719
» Typing linear constraints
Sort
View
ADHOCNOW
2008
Springer
15 years 4 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
CEC
2007
IEEE
15 years 4 months ago
Graph design by graph grammar evolution
— Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular opti...
Martin H. Luerssen, David M. W. Powers
DFT
2007
IEEE
112views VLSI» more  DFT 2007»
15 years 4 months ago
Estimation of Electromigration-Aggravating Narrow Interconnects Using a Layout Sensitivity Model
During semiconductor manufacturing, particles undesirably depose on the surface of the wafer causing “open” and “short” defects to interconnects. In this paper, a third ty...
Rani S. Ghaida, Payman Zarkesh-Ha
GLVLSI
2007
IEEE
140views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Structured and tuned array generation (STAG) for high-performance random logic
Regularly structured design techniques can combat complexity on a variety of fronts. We present the Structured and Tuned Array Generation (STAG) design methodology, which provides...
Matthew M. Ziegler, Gary S. Ditlow, Stephen V. Kos...
INFOCOM
2007
IEEE
15 years 4 months ago
Joint Congestion Control and Distributed Scheduling for Throughput Guarantees in Wireless Networks
— We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction d...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar