Sciweavers

1590 search results - page 200 / 318
» Dependence Modeling for Stochastic Simulation
Sort
View
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 4 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
163
Voted
JMLR
2012
13 years 7 months ago
Deep Learning Made Easier by Linear Transformations in Perceptrons
We transform the outputs of each hidden neuron in a multi-layer perceptron network to have zero output and zero slope on average, and use separate shortcut connections to model th...
Tapani Raiko, Harri Valpola, Yann LeCun
GLOBECOM
2008
IEEE
15 years 11 months ago
Foresighted Resource Reciprocation Strategies in P2P Networks
—We consider peer-to-peer (P2P) networks, where multiple peers are interested in sharing content. While sharing resources, autonomous and self-interested peers need to make decis...
Hyunggon Park, Mihaela van der Schaar
CHARME
1997
Springer
105views Hardware» more  CHARME 1997»
15 years 8 months ago
Simulation-based verification of network protocols performance
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
Mario Baldi, Fulvio Corno, Maurizio Rebaudengo, Pa...
142
Voted
TWC
2008
119views more  TWC 2008»
15 years 4 months ago
Flow-level performance of opportunistic OFDM-TDMA and OFDMA networks
Abstract--In this paper, the flow-level performance of opportunistic scheduling in orthogonal frequency division multiplexing (OFDM) networks is studied. The analysis accounts for ...
Lei Lei, Chuang Lin, Jun Cai, Xuemin Shen