Sciweavers

ANOR
2016
10 years 16 days ago
Stochastic multi-objective optimization: a survey on non-scalarizing methods
Abstract. Currently, stochastic optimization on the one hand and multi-objective optimization on the other hand are rich and well-established special fields of Operations Research...
Walter J. Gutjahr, Alois Pichler
ANOR
2016
10 years 16 days ago
From evidence-based policy making to policy analytics
This paper aims at addressing the problem of what characterises decisionaiding for public policy making problem situations. Under such a perspective it analyses concepts like “p...
Giada De Marchi, Giulia Lucertini, Alexis Tsouki&a...
ANOR
2016
10 years 16 days ago
Decomposition algorithm for large-scale two-stage unit-commitment
Everyday, electricity generation companies submit a generation schedule to the grid operator for the coming day; computing an optimal schedule is called the unit-commitment problem...
Wim van Ackooij, Jérôme Malick
ANCS
2016
ACM
10 years 16 days ago
Is Memory Disaggregation Feasible?: A Case Study with Spark SQL
This paper explores the feasibility of entirely disaggregated memory from compute and storage for a particular, widely deployed workload, Spark SQL [9] analytics queries. We measu...
Pramod Subba Rao, George Porter
ANCS
2016
ACM
10 years 16 days ago
A Study of Speed Mismatches Between Communicating Virtual Machines
This work addresses an apparently simple but elusive problem that arises when doing high speed networking on Virtual Machines. When a VM and its peer (usually the hypervisor) proc...
Luigi Rizzo, Stefano Garzarella, Giuseppe Lettieri...
ANALCO
2016
43views more  ANALCO 2016»
10 years 16 days ago
Scaling limit of random k-trees
We consider a random k-tree Gn,k that is uniformly selected from the class of labelled k-trees with n + k vertices. Since 1-trees are just trees, it is well-known that Gn,1 (after ...
Michael Drmota, Emma Yu Jin
ANALCO
2016
65views more  ANALCO 2016»
10 years 16 days ago
The CLT Analogue for Cyclic Urns
A cyclic urn is an urn model for balls of types 0, . . . , m − 1 where in each draw the ball drawn, say of type j, is returned to the urn together with a new ball of type j + 1 ...
Noela S. Müller, Ralph Neininger
152
Voted
AML
2016
62views Algorithms» more  AML 2016»
10 years 16 days ago
Martin's maximum revisited
We present several results relating the general theory of the stationary tower forcing developed by Woodin with forcing axioms. In particular we show that, in combination with str...
Matteo Viale
150
Voted
AML
2016
63views Algorithms» more  AML 2016»
10 years 16 days ago
ZF + DC + AX4
We consider mainly the following version of set theory: “ZF + DC and for every λ, λℵ0 is well ordered”, our thesis is that this is a reasonable set theory, e.g. on the one ...
Saharon Shelah