269 search results - page 15 / 54 » Conditionalization and total knowledge |
144
click to vote
GOSLER
1995
15 years 8 months ago
1995
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
169
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We consider an opportunistic spectrum access (OSA) problem where the time-varying condition of each channel (e.g., as a result of random fading or certain primary users' activ...
121
click to vote
AAAI
1996
15 years 5 months ago
1996
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
156
click to vote
JSAC
2007
15 years 4 months ago
2007
— We consider the design of Tomlinson-Harashima (TH) precoders for broadcast channels in the presence of channel uncertainty. For systems in which uplink-downlink reciprocity is ...
149
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
When we take a picture through a window the image we obtain is often a linear superposition of two images: the image of the scene beyond the window plus the image of the scene ref...