ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Computersysteme, 215
ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Informationssysteme, 223
Geneva timber and forest study papers, 26
IBK Bericht, 332
Most large software systems rely on extensive amounts of persistent data — objects. Most large software systems last a long time, over which they need to change program elements — classes. Inevitably, these two characteristics clash: how do we retrieve previously “persisted” objects when the classes that describe them have changed? Naive solutions, such as initializing new fields to default values, are dangerous, since they risk invalidating the consistency of objects. For example it would...
Technical report, 293
Technical report, 349
Technical report / Federal Institute of Technology, Computer Science Department, 267
We introduce unique sink orientations of grids as digraph models for many well-studied problems, including linear programming over products of simplices and generalized linear complementarity problems over P-matrices (PGLCP). We investigate the combinatorial structure of such orientations and develop randomized algorithms for nding the sink. We show that the orientations arising from PGLCP satisfy the Holt-Klee condition known to hold for polytope digraphs, and we give the rst expected linear-time algorithms for solving PGLCP with...
In the transport modelling community, there is a growing understanding that socio-economic attributes are not sufficient to characterise travellers and make forecasts about their travel behaviour. Therefore, an increasing number of studies has recently been published that integrates latent variables representing attitudes, perceptions and preferences into choice models. Since it is impossible to measure these latent variables directly, psychometric scales are used as indicators for the latent variables. For the study presented in this paper,...
Technical report, 288
Technical Report / ETH Zurich, Department of Computer Science, 369