Sciweavers

763 search results - page 88 / 153
» Engineering Shortest Path Algorithms
Sort
View
ASPDAC
2005
ACM
114views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Redundant-via enhanced maze routing for yield improvement
- Redundant via insertion is a good solution to reduce the yield loss by via failure. However, the existing methods are all post-layout optimizations that insert redundant via afte...
Gang Xu, Li-Da Huang, David Z. Pan, Martin D. F. W...
ADHOC
2007
159views more  ADHOC 2007»
13 years 9 months ago
Cross-layer adaptive control for wireless mesh networks
Abstract— This paper investigates optimal routing and adaptive scheduling in a wireless mesh network composed of mesh clients and mesh routers. The mesh clients are power constra...
Michael J. Neely, Rahul Urgaonkar
SECON
2008
IEEE
14 years 4 months ago
Practical Algorithms for Gathering Stored Correlated Data in a Network
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
Ramin Khalili, James F. Kurose
TASE
2011
IEEE
13 years 1 months ago
Multiresource Shop Scheduling With Resource Flexibility and Blocking
—This paper proposes a general scheduling model that extends job-shop scheduling models to incorporate important features of real manufacturing systems. More precisely, each oper...
Yazid Mati, Xiaolan Xie
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
14 years 1 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht