4451 search results - page 421 / 891 » On Random Ordering Constraints |
156
click to vote
PPL
2010
15 years 5 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
170
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
160
Voted
COOPIS
1999
IEEE
15 years 11 months ago
1999
IEEE
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinationsof criteria. In [6], Fa...
172
Voted
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— In this paper, a downlink communication system, in which a Base Station (BS) equipped with M antennas communicates with N users each equipped with K receive antennas is conside...
173
Voted
TCAD
2008
15 years 6 months ago
2008
Abstract--In this paper, we propose track routing and optimization for yield (TROY), the first track router for the optimization of yield loss due to random defects. As the probabi...