Sciweavers

15792 search results - page 2859 / 3159
» Computational Abstraction Steps
Sort
View
TCAD
2008
102views more  TCAD 2008»
15 years 6 months ago
Quantum Circuit Simplification and Level Compaction
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller...
TCAD
2008
106views more  TCAD 2008»
15 years 6 months ago
Track Routing and Optimization for Yield
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...
Minsik Cho, Hua Xiang, Ruchir Puri, David Z. Pan
TCOM
2008
151views more  TCOM 2008»
15 years 6 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
TCOM
2008
74views more  TCOM 2008»
15 years 6 months ago
Stability of a frame-based oldest-cell-first maximal weight matching algorithm
Abstract-- Input-queued cell switches employing the oldestcell-first (OCF) policy have been shown to yield low mean delay characteristics. Moreover, it has been proven that OCF is ...
Xike Li, Itamar Elhanany
ASE
2005
145views more  ASE 2005»
15 years 6 months ago
Developing Ambient Intelligence Systems: A Solution based on Web Services
Enabling the ambient intelligence vision means that consumers will be provided with universal and immediate access to available content and services, together with ways of effectiv...
Valérie Issarny, Daniele Sacchetti, Ferda T...
« Prev « First page 2859 / 3159 Last » Next »