Sciweavers

10608 search results - page 1747 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
VTC
2007
IEEE
15 years 7 months ago
Power Optimization of IDMA Systems with Different Target BER Constraints
— Interleave Division Multiple Access (IDMA) is a promising air interface for future wireless networks. Optimization of access schemes regarding cross user aspects is also a topi...
Petra Weitkemper, Karl-Dirk Kammeyer
94
Voted
VTS
2007
IEEE
135views Hardware» more  VTS 2007»
15 years 7 months ago
High Level Synthesis of Degradable ASICs Using Virtual Binding
—As the complexity of the integrated circuits increases, they become more susceptible to manufacturing faults, decreasing the total process yield. Thus, it would be desirable to ...
Nima Honarmand, A. Shahabi, Hasan Sohofi, Maghsoud...
98
Voted
ADAEUROPE
2007
Springer
15 years 7 months ago
Modelling Remote Concurrency with Ada
When developing concurrent software, a proper engineering practice is to choose a good level of abstraction for expressing concurrency control. Ideally, this level should provide p...
Claude Kaiser, Christophe Pajault, Jean-Fran&ccedi...
88
Voted
APPT
2007
Springer
15 years 7 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami
89
Voted
ATAL
2007
Springer
15 years 7 months ago
A Q-decomposition and bounded RTDP approach to resource allocation
This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, a Qdecomposition...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
« Prev « First page 1747 / 2122 Last » Next »