Sciweavers

451 search results - page 66 / 91
» On Parameterized Exponential Time Complexity
Sort
View
TCAD
2010
168views more  TCAD 2010»
13 years 4 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
TWC
2010
13 years 4 months ago
A PAPR Reduction Method Based on Artificial Bee Colony Algorithm for OFDM Signals
Abstract--One of the major drawbacks of orthogonal frequency division multiplexing (OFDM) signals is the high peak to average power ratio (PAPR) of the transmitted signal. Many PAP...
Yajun Wang, Wen Chen, Chintha Tellambura
STACS
2010
Springer
14 years 5 months ago
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
François Le Gall
ALDT
2009
Springer
142views Algorithms» more  ALDT 2009»
14 years 4 months ago
Finding Best k Policies
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Peng Dai, Judy Goldsmith
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
14 years 4 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...