1816 search results - page 17 / 364 » A New Approach for Solving the Maximum Clique Problem |
102
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
SAC
2004
ACM
15 years 5 months ago
2004
ACM
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Belief propagation over pairwise connected Markov Random Fields has become a widely used approach, and has been successfully applied to several important computer vision problems....
ECML
2006
Springer
15 years 1 months ago
2006
Springer
In this article, I will consider Markov Decision Processes with two criteria, each defined as the expected value of an infinite horizon cumulative return. The second criterion is e...
TASE
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...