Sciweavers

426 search results - page 37 / 86
» Run lengths and liquidity
Sort
View
WSC
2000
13 years 11 months ago
Improved decision processes through simultaneous simulation and time dilation
Simulation models are often not used to their full potential in the decision-making process. The default simulation strategy of simple serial replication of fixed length runs mean...
Paul Hyden, Lee Schruben
EOR
2008
52views more  EOR 2008»
13 years 10 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
IPL
2008
114views more  IPL 2008»
13 years 10 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
AML
2005
82views more  AML 2005»
13 years 9 months ago
The canonical function game
The canonical function game is a game of length 1 introduced by W. Hugh Woodin which falls inside a class of games known as Neeman games. Using large cardinals, we show that it is...
Paul B. Larson
JCSS
2010
190views more  JCSS 2010»
13 years 8 months ago
Pattern matching with don't cares and few errors
We present solutions for the k-mismatch pattern matching problem with don’t cares. Given a text t of length n and a pattern p of length m with don’t care symbols and a bound k...
Raphaël Clifford, Klim Efremenko, Ely Porat, ...