Sciweavers

4377 search results - page 863 / 876
» Mass problems and randomness
Sort
View
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
14 years 9 months ago
Non-Clairvoyant Scheduling for Minimizing Mean Slowdown
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
Nikhil Bansal, Kedar Dhamdhere, Jochen Könema...
AI
2002
Springer
14 years 9 months ago
Ensembling neural networks: Many could be better than all
Neural network ensemble is a learning paradigm where many neural networks are jointly used to solve a problem. In this paper, the relationship between the ensemble and its compone...
Zhi-Hua Zhou, Jianxin Wu, Wei Tang
BMCBI
2004
114views more  BMCBI 2004»
14 years 9 months ago
Extending the mutual information measure to rank inferred literature relationships
Background: Within the peer-reviewed literature, associations between two things are not always recognized until commonalities between them become apparent. These commonalities ca...
Jonathan D. Wren
COMCOM
2004
127views more  COMCOM 2004»
14 years 9 months ago
Traffic splitting in a network: split traffic models and applications
The contemporary high-speed networks, e.g. the Internet and asynchronous transfer mode (ATM) networks provide a convenient and cost-effective communication platform to carry the e...
Huei-Wen Ferng, Cheng-Ching Peng
CORR
2002
Springer
98views Education» more  CORR 2002»
14 years 9 months ago
An Empirical Model for Volatility of Returns and Option Pricing
In a seminal paper in 1973, Black and Scholes argued how expected distributions of stock prices can be used to price options. Their model assumed a directed random motion for the ...
Joseph L. McCauley, Gemunu H. Gunaratne