1629 search results - page 202 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
ALT
2010
Springer
14 years 11 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
TWC
2010
14 years 4 months ago
2010
In this paper, we consider a wireless communication scenario with multiple source-destination pairs communicating through several cooperative amplify-and-forward relay terminals. T...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
ISCC
2002
IEEE
15 years 3 months ago
2002
IEEE
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
TSP
2008
14 years 10 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...