Session B Wrap-up Summary and Commentary Roman Barták Charles University (Czech Republic)

Slides:

Advertisements

Similar presentations

METAGAMER: An Agent for Learning and Planning in General Games Barney Pell NASA Ames Research Center.

Advertisements

Contextualising the learning process in Sports and Materials Science C.L Davis, M. Jenkins and E. Wilcock School of Engineering University of Birmingham.

Ali Husseinzadeh Kashan Spring 2010

On the Boundary of Planning and Scheduling: A Study Roman Barták Charles University, Prague

Presented by: GROUP 7 Gayathri Gandhamuneni & Yumeng Wang.

Active and Accelerated Learning of Cost Models for Optimizing Scientific Applications Piyush Shivam, Shivnath Babu, Jeffrey Chase Duke University.

On the Potential of Automated Algorithm Configuration Frank Hutter, University of British Columbia, Vancouver, Canada. Motivation for automated tuning.

COMPUTER SIMULATION MODELS AND MULTILEVEL CANCER CONTROL INTERVENTIONS Joseph Morrissey, Kristen Hassmiller Lich, Rebecca Anhang Price, Jeanne Mandelblatt.

Benchmarking Parallel Code. Benchmarking2 What are the performance characteristics of a parallel code? What should be measured?

ICKEP International Competition for Knowledge Engineering in Planning - A PROPOSAL Lee McCluskey KE TCU.

An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems Pavel Surynek Czech Technical University Prague

DECO3008 Design Computing Preparatory Honours Research KCDCC Mike Rosenman Rm 279

1 Experimental Methodology H Experimental methods can be used to: – demonstrate that a new concept, technique, or algorithm is feasible –demonstrate that.

Provisional draft 1 ICT Work Programme Challenge 2 Cognition, Interaction, Robotics NCP meeting 19 October 2006, Brussels Colette Maloney, PhD.

Data Representation using Graphs Hoang Dang. Motivation.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Project.

ADAPTIVE SYSTEMS & USER MODELING: course structure revisited Alexandra I. Cristea USI intensive course “Adaptive Systems” April-May 2003.

7. Experiments 6. Theoretical Guarantees Let the local policy improvement algorithm be policy gradient. Notes: These assumptions are insufficient to give.

DEI/CISUC Evonet Summer School - Parma © 2003 Ernesto Costa 1 Optimization in Dynamic Environments Ernesto Costa DEI/CISUC

& CLP Group at Charles Uni. Roman Barták Charles University, Prague PLANSERVE.

ICKEP International Competition for Knowledge Engineering in Planning Lee McCluskey PLANET Knowledge Engineering.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2001 Lecture 6 Start of Part II Material Monday,

A good paper Prof. Bennett Math Model of Learning and Discovery Based on web page by Pat Langley.

Title Your name date. Overview Problem motivation –what is the purpose of the paper, what is the significance of the problem being solved? Context –what.

Scatter search for project scheduling with resource availability cost Jia-Xian Zhu.

Introduction to Benchmarking (II): The current situation in other imaging communities Introduction to Benchmarking (II): The current situation in other.

Maisrul Drama Maisrul

The Project AH Computing. Functional Requirements  What the product must do!  Examples attractive welcome screen all options available as clickable.

Experiment Databases: Towards better experimental research in machine learning and data mining Hendrik Blockeel Katholieke Universiteit Leuven.

G RID R ESOURCE BROKER FOR SCHEDULING COMPONENT - BASED APPLICATIONS ON DISTRIBUTED RESOURCES Reporter : Yi-Wei Wu.

Introduction to the Mobile Security (MD)  Chaitanya Nettem  Rawad Habib  2015.

How to read and critique a technical paper?. 3 phases to reading Determine if there is anything interesting at all in the paper. Determine which portion.

ISE420 Algorithmic Operations Research Asst.Prof.Dr. Arslan M. Örnek Industrial Systems Engineering.

Roger Sessions ObjectWatch An Introduction to the Major EA Methodologies.

Planning and Scheduling Two Worlds in One System Roman Barták Charles University in Prague (Visopt B.V.)

Presenter: Hung-Fu Li HPDS Lab. NKUAS vCUDA: GPU Accelerated High Performance Computing in Virtual Machines Lin Shi, Hao Chen and Jianhua.

ENG3050 Embedded Reconfigurable Computing Systems General Information Handout Winter 2015, January 5 th.

Using Genetic Programming to Learn Probability Distributions as Mutation Operators with Evolutionary Programming Libin Hong, John Woodward, Ender Ozcan,

CHAPTER 1 Theories, issues and influences in human resource management.

Regional Policy Eurobarometer survey about Citizens' awareness and perceptions of EU Regional policy Key findings Peter Fischer, European Commission, Directorate-

© J. Christopher Beck 2007 Commentary on Session A J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toronto, Canada.

Iterated Local Search (ILS) for the Quadratic Assignment Problem (QAP) Tim Daniëlse en Vincent Delvigne.

Space Operations as a Guide for a Real-World Scheduling Competition Eduardo Romero Marcelo Oglietti

Systems Realization Laboratory Workshop: Uncertainty Representation in Robust and Reliability-Based Design Jason Aughenbaugh (Univ Texas, Austin) Zissimos.

A-1 © 2000 UW CSE University of Washington Computer Programming I Lecture 21: Course Wrap-up and Look Ahead.

Intelligent controller design based on gain and phase margin specifications Daniel Czarkowski  and Tom O’Mahony* Advanced Control Group, Department of.

Roman Barták Visopt B.V. (NL) / Charles University (CZ) IP&S in complex and dynamic areas Visopt Experience.

WERST – Methodology Group

Paper Title Author/affiliation/ address. Outline (0-1 slide) Motivation Background information/Related works Proposed Method Results Summary Future.

A New Threat Evaluation Method Based on Cloud Model Wang Bailing 1*, Guo Shi 1, Qu Yun 1, Wang Xiaopeng 1, Liu Yang 1 1 Harbin Institute of Technology,

Appropriate Use of Assessment Methods. Assessment Methods Utilized for “assessment for learning” ◦For promoting learning Applied for “assessment of learning”

Managing Web Server Performance with AutoTune Agents by Y. Diao, J. L. Hellerstein, S. Parekh, J. P. Bigus Presented by Changha Lee.

Formulation of PR / business plans

EFFICIENT STRATEGIES FOR REPRESENTING AND EVALUATING THE EFFECT OF PROPAGATION IMPAIRMENTS ON THE PERFORMANCE OF WIRELESS COMMUNICATIONS SYSTEMS Presented.

Detection of Vowel Onset Point in Speech S.R. Mahadeva Prasanna & Jinu Mariam Zachariah Department of Computer Science & Engineering Indian Institute.

How to Write Literature Review ww.ePowerPoint.com

1 Review of report "LSDX: A New Labeling Scheme for Dynamically Updating XML Data"

Information Session Presented by: CPE Admin Team.

Tommy Messelis * Stefaan Haspeslagh Burak Bilgin Patrick De Causmaecker Greet Vanden Berghe *

SOAP RMI Aleksander Slominski, Madhusudhan Govindaraju, Randall Bramley, Dennis Gannon Indiana University Extreme! Lab A New-Old Programming Model for.

1 Performance Impact of Resource Provisioning on Workflows Gurmeet Singh, Carl Kesselman and Ewa Deelman Information Science Institute University of Southern.

BSA 411 Week 2 Individual Assignment Business Application System Proposal Business Application System Proposal Submit a 4- to 5-page paper consisting of.

Skills by stealth Introducing academic culture to low level

<Student’s name>

TESOL 508 Enthusiastic Studysnaptutorial.com

SAT-Based Area Recovery in Technology Mapping

Advanced Computational and Communication Paradigms

Compendium CD of NRC Reports on Assessment of Student Learning

Question 6 – Medicine paper

Social Practice of the language: Describe and share information

Presentation transcript:

Session B Wrap-up Summary and Commentary Roman Barták Charles University (Czech Republic)

SSC 2007, Roman Barták 2Summary Three papers proposing benchmark areas  Reactive scheduling  Over-subscribed scheduling  Real-life scheduling Wrap-up paper on benchmarks Two papers describing experience with other competitions  International Timetabling Competition  International Planning Competition

SSC 2007, Roman Barták 3 Other competitions We should learn from others. We are completely different. Why should one run a (scheduling) competition?  compare the systems or algorithms?  bridging the gap between theory and practice?  advance the research?  drive the research?  promote the research?  just to play? ……

SSC 2007, Roman Barták 4Benchmarks real-life motivated vs. academic problems going beyond classical scheduling  dynamic aspects  over-subscribed  different objectives (robustness,…) common representation  language for covering „all“ scheduling problems generating problem instances vs. real-life data  parameters to vary problem hardness or to vary problem type evaluation criteria  is runtime so bad? conclusions from the competition  any winner?