1185 search results - page 127 / 237 » The Equivalence of Sampling and Searching |
96
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
2006
IEEE
— For many wireless communication links, such as those employing turbo codes or sequentially-decoded convolutional codes, the power consumption of the decoder at the receiver dep...
116
Voted
CP
2001
Springer
15 years 5 months ago
2001
Springer
Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-e...
132
click to vote
PRICAI
1998
Springer
15 years 4 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
105
Voted
ICMLA
2003
15 years 2 months ago
2003
— This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search spa...
INFORMATICALT
2007
15 years 17 days ago
2007
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...