Loading
- other research product . 2007Open Access EnglishAuthors:Chen, Eva; Yu, Bo; Kolitz, Klaus;Publisher: Dagstuhl Seminar Proceedings. 06461 - Negotiation and Market Engineering
Negotiation or Auction? The NorA project
- other research product . 2014Open Access EnglishAuthors:Ahmadian, Sara; Behsaz, Babak; Friggstad, Zachary; Jorati, Amin; Salavatipour, Mohammad R.; Swamy, Chaitanya;Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer InformatikProject: NSERC
We consider a facility-location problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimum-load k-facility location (MLkFL) problem, which is defined as follows. We have a s...
- other research product . 2013Open Access EnglishAuthors:Bulatov, Andrei; Dalmau, Victor; Thurley, Marc;Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer InformatikProject: NSERC
- other research product . 2008Open Access EnglishAuthors:Ahmed, Amal; Benton, Nick; Hofmann, Martin; Morrisett, Greg;Publisher: Dagstuhl Seminar Proceedings. 08061 - Types, Logics and Semantics for State
From 3 February to 8 February 2008, the Dagstuhl Seminar 08061 ``Types, Logics and Semantics for State'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and...
- other research product . 2009Open Access EnglishAuthors:Gnewuch, Michael;Publisher: Dagstuhl Seminar Proceedings. 09391 - Algorithms and Complexity for Continuous Problems
A mixed sequence is a sequence in the $s$-dimensional unit cube which one obtains by concatenating a $d$-dimensional low-discrepancy sequence with an $s-d$-dimensional random sequence. We discuss some probabilistic bounds on the star discrepancy of mixed sequences.
- other research product . 2009Open Access EnglishAuthors:Das Sarma, Anish; de Keijzer, Ander; Deshpande, Amol; Haas, Peter J.; Ilyas, Ihab F.; Koch, Christoph; Neumann, Thomas; Olteanu, Dan; Theobald, Martin; Vassalos, Vasilis;Publisher: Dagstuhl Seminar Proceedings. 08421 - Uncertainty Management in Information Systems
This report briefly summarizes the discussions carried out in the working group on classification, representation and modeling of uncertain data. The discussion was divided into two subgroups: the first subgroup studied how different representation and modeling alternat...
- other research product . 2011Open Access EnglishAuthors:de Lemos, Rogerio; Giese, Holger; Shaw, Mary;Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
Softwares ability to adapt at run-time to changing user needs, system intrusions or faults, changing operational environment, and resource variability has been proposed as a means to cope with the complexity of todays software- intensive systems. Such self-adaptive syst...
- other research product . 2007Open Access EnglishAuthors:Merlo, Ettore;Publisher: Dagstuhl Seminar Proceedings. 06301 - Duplication, Redundancy, and Similarity in SoftwareProject: NSERC
An original method of spectral similarity analysis for plagiarism detection in university project is presented. The approach is based on a clone detection tool called CLAN that performs metrics based similarity analysis of source code fragments. Definitions and algorith...
- other research product . 2008Open Access EnglishAuthors:Hertling, Peter; Selivanov, Victor; Thomas, Wolfgang; Wadge, William W.; Wagner, Klaus;Publisher: Dagstuhl Seminar Proceedings. 08271 - Topological and Game-Theoretic Aspects of Infinite Computations
The theory of the infinite behaviour of continuously operating computing devices is of primary importance for several branches of theoretical and practical computer science. In particular, it is fundamental for the verification and synthesis of reactive systems like mic...
- other research product . 2007Open Access EnglishAuthors:Evans, William S.;Publisher: Dagstuhl Seminar Proceedings. 06301 - Duplication, Redundancy, and Similarity in Software
The talk focused on a grammar-based technique for identifying redundancy in program code and taking advantage of that redundancy to reduce the memory required to store and execute the program. The idea is to start with a simple context-free grammar that represents all v...