9949 search results - page 380 / 1990 » On the Network Complexity of Selection |
211
Voted
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
152
click to vote
ESANN
2001
15 years 8 months ago
2001
Neural networks use neurons of the same type in each layer but such architecture cannot lead to data models of optimal complexity and accuracy. Networks with architectures (number ...
221
Voted
IJON
2008
15 years 5 months ago
2008
The problem of inductive supervised learning is discussed in this paper within the context of multi-objective (MOBJ) optimization. The smoothness-based apparent (effective) comple...
189
click to vote
QOFIS
2004
Springer
16 years 6 days ago
2004
Springer
In optical transport networks algorithms dealing with the lightpath selection process select routes and assign wavelengths based on the routing information obtained from the networ...
183
click to vote
ECIR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional “resource ...