Algorithms for Optimization with Incomplete Information Dagstuhl Seminar
نویسندگان
چکیده
From 16.01.05 to 21.01.05, the Dagstuhl Seminar 05031 Algorithms for Optimization with Incomplete Information was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
منابع مشابه
Real-World Visual Computing (Dagstuhl Seminar 13431)
Deduction and Arithmetic (Dagstuhl Seminar 13411) Nikolaj Bjørner, Reiner Hähnle, Tobias Nipkow, and Christoph Weidenbach . . . . . . 1 Genomic Privacy (Dagstuhl Seminar 13412) Kay Hamacher, Jean Pierre Hubaux, and Gene Tsudik . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421) Glencora Borradaile, Philip Klein,...
متن کاملModels and Algorithms for Optimization in Logistics Dagstuhl Seminar
From June 21 to June 26, 2009, the Dagstuhl Seminar 09261 on Models and Algorithms for Optimization in Logistics was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abst...
متن کاملScience and Engineering of Cyber-Physical Systems (Dagstuhl Seminar 11441)
Science and Engineering of Cyber-Physical Systems (Dagstuhl Seminar 11441) Holger Giese, Bernhard Rumpe, Bernhard Schätz, and Janos Sztipanovits . . . . . . . . 1 Data Mining, Networks and Dynamics (Dagstuhl Seminar 11451) Lars Elden and Andreas Frommer . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 Analysis of Dynamic Social and Technological N...
متن کاملLimitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082)
This report documents the program and the outcomes of Dagstuhl Seminar 15082 “Limitations of convex programming: lower bounds on extended formulations and factorization ranks” held in February 2015. Summaries of a selection of talks are given in addition to a list of open problems raised during the seminar. Seminar February 15–20, 2015 – http://www.dagstuhl.de/15082 1998 ACM Subject Classificat...
متن کاملPacking and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)
From 27.02.2011 to 4.03.2011, the Dagstuhl Seminar 11091 “Packing and Scheduling Algorithms for Information and Communication Services” was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstrac...
متن کامل