Sciweavers

2354 search results - page 143 / 471
» Randomness, Stochasticity and Approximations
Sort
View
EOR
2010
116views more  EOR 2010»
13 years 9 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
IM
2007
13 years 9 months ago
Pursuit-Evasion in Models of Complex Networks
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
Anthony Bonato, Pawel Pralat, Changping Wang
IJKESDP
2010
60views more  IJKESDP 2010»
13 years 7 months ago
Portfolio selection problems with normal mixture distributions including fuzziness
— In this paper, several portfolio selection problems with normal mixture distributions including fuzziness are proposed. Until now, many researchers have proposed portfolio mode...
Takashi Hasuike, Hiroaki Ishii
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 9 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
COMCOM
2008
99views more  COMCOM 2008»
13 years 9 months ago
Performance implications of fluctuating server capacity
In this paper, we consider a variant of an M/M/c/c loss system with fluctuating server capacity. Given a set of primary inputs, such as arrival rate, service rate, and capacity fl...
Jingxiang Luo, Carey L. Williamson