Sciweavers

4908 search results - page 334 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
CORR
2011
Springer
213views Education» more  CORR 2011»
15 years 1 months ago
Adapting to Non-stationarity with Growing Expert Ensembles
Forecasting sequences by expert ensembles generally assumes stationary or near-stationary processes; however, in complex systems and many real-world applications, we are frequentl...
Cosma Rohilla Shalizi, Abigail Z. Jacobs, Aaron Cl...
IANDC
2011
84views more  IANDC 2011»
15 years 1 months ago
Teaching randomized learners with feedback
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
Frank J. Balbach, Thomas Zeugmann
EOR
2010
101views more  EOR 2010»
15 years 1 months ago
A linear implementation of PACMAN
PACMAN (Passive and Active Compensability Multicriteria ANalysis) is a multiple criteria methodology based on a decision maker oriented notion of compensation, called compensabili...
Silvia Angilella, Alfio Giarlotta, Fabio Lamantia
HEURISTICS
2010
15 years 1 months ago
A large neighbourhood search approach to the multi-activity shift scheduling problem
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
Claude-Guy Quimper, Louis-Martin Rousseau
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
15 years 1 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...