Sciweavers

14165 search results - page 585 / 2833
» The generalized two-server problem
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
15 years 7 months ago
On the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
Edith Hemaspaandra, Henning Schnoor
EOR
2006
76views more  EOR 2006»
15 years 7 months ago
Location of slaughterhouses under economies of scale
The facility location problem described in this paper comes from an industrial application in the slaughterhouse industry of Norway. Investigations show that the slaughterhouse in...
John v. d. Broek, Peter Schütz, Leen Stougie,...
FTCIT
2007
88views more  FTCIT 2007»
15 years 7 months ago
Topics in Multi-User Information Theory
This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition...
Gerhard Kramer
IOR
2007
82views more  IOR 2007»
15 years 7 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
JCP
2007
143views more  JCP 2007»
15 years 7 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio