522 search results - page 50 / 105 » On the Hardness of the Noncommutative Determinant |
IJSNET
2007
13 years 8 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
TON
2008
13 years 7 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
TSP
2008
13 years 7 months ago
2008
The peak-to-average power ratio (PAR) of orthogonal frequency division multiplexing (OFDM) systems can be reduced by using an optimal set of subcarrier signs. However, this sign se...
AIR
2004
13 years 7 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
COMBINATORICS
2004
13 years 7 months ago
2004
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...