3008 search results - page 391 / 602 » Independence in connected graphs |
193
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
156
click to vote
IADIS
2004
15 years 8 months ago
2004
In order to heighten the effectiveness of web-based exploratory learning, we have designed and implemented adaptive link generation that facilitates multiperspective thinking abou...
181
click to vote
NIPS
2004
15 years 8 months ago
2004
Many works have shown that strong connections relate learning from examples to regularization techniques for ill-posed inverse problems. Nevertheless by now there was no formal ev...
146
click to vote
NIPS
2000
15 years 8 months ago
2000
In memory consolidation, declarative memories which initially require the hippocampus for their recall, ultimately become independent of it. Consolidation has been the focus of nu...
157
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...