default search action
Erich Christian Teppan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c30]Patrick Rodler, Erich Teppan, Dietmar Jannach:
Summary of "Randomized Problem-Relaxation Solving for Over-Constrained Schedules" (Extended Abstract). DX 2024: 33:1-33:4 - 2023
- [c29]Giacomo Da Col, Erich Teppan:
Pursuing the Optimal CP Model: A Batch Scheduling Case Study. IntelliSys (1) 2023: 508-520 - 2022
- [c28]Giacomo Da Col, Eva Eggeling, Marco A. Hudelist, Christoph Schinko, Christof Surtmann, Erich Teppan:
Sensor-Based Moisture Prediction for Flat Roofs. PAIS@ECAI 2022: 149-152 - [c27]Erich Christian Teppan:
Types of Flexible Job Shop Scheduling: A Constraint Programming Experiment. ICAART (3) 2022: 516-523 - [p2]Gerhard Friedrich, Martin Gebser, Erich Christian Teppan:
Symbolic Artificial Intelligence Methods for Prescriptive Analytics. Digital Transformation 2022: 385-414 - 2021
- [c26]Patrick Rodler, Erich Teppan, Dietmar Jannach:
Randomized Problem-Relaxation Solving for Over-Constrained Schedules. KR 2021: 696-701 - [i3]Giacomo Da Col, Erich Teppan:
Large-Scale Benchmarks for the Job Shop Scheduling Problem. CoRR abs/2102.08778 (2021) - 2020
- [c25]Erich Teppan, Markus Zanker:
Exploiting Answer Set Programming for Building explainable Recommendations. ISMIS 2020: 395-404 - [i2]Patrick Rodler, Erich Teppan:
The Scheduling Job-Set Optimization Problem: A Model-Based Diagnosis Approach. CoRR abs/2009.11142 (2020)
2010 – 2019
- 2019
- [c24]Giacomo Da Col, Erich Christian Teppan:
Industrial Size Job Shop Scheduling Tackled by Present Day CP Solvers. CP 2019: 144-160 - [c23]Giacomo Da Col, Erich Teppan:
Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem. ICLP Technical Communications 2019: 259-265 - 2018
- [j9]Andreas A. Falkner, Gerhard Friedrich, Konstantin Schekotihin, Richard Taupe, Erich Christian Teppan:
Industrial Applications of Answer Set Programming. Künstliche Intell. 32(2-3): 165-176 (2018) - [c22]Erich Teppan, Giacomo Da Col:
Automatic Generation of Dispatching Rules for Large Job Shops by Means of Genetic Algorithms. CIMA@ICTAI 2018: 43-57 - [c21]Erich Christian Teppan:
Dispatching Rules Revisited-A Large Scale Job Shop Scheduling Experiment. SSCI 2018: 561-568 - 2017
- [j8]Erich Christian Teppan:
On the complexity of the partner units decision problem. Artif. Intell. 248: 112-122 (2017) - 2016
- [j7]Erich Christian Teppan, Gerhard Friedrich, Georg Gottlob:
Tractability frontiers of the partner units configuration problem. J. Comput. Syst. Sci. 82(5): 739-755 (2016) - [c20]Erich Christian Teppan, Gerhard Friedrich:
Heuristic Constraint Answer Set Programming. ECAI 2016: 1692-1693 - [c19]Richard Taupe, Erich Teppan:
Influence of ASP Language Constructs on the Performance of State-of-the-Art Solvers. KI 2016: 88-101 - [c18]Giacomo Da Col, Erich Christian Teppan:
Declarative Decomposition and Dispatching for Large-Scale Job-Shop Scheduling. KI 2016: 134-140 - 2014
- [c17]Gerhard Friedrich, Melanie Frühstück, Vera Mersheeva, Anna Ryabokon, Maria Sander, Andreas Starzacher, Erich Teppan:
Representing Production Scheduling with Constraint Answer Set Programming. OR 2014: 159-165 - 2013
- [c16]Erich Christian Teppan, Gerhard Friedrich:
Declarative Heuristics in Constraint Satisfaction. ICTAI 2013: 996-1003 - [i1]Erich Christian Teppan, Gerhard Friedrich:
The Partner Units Configuration Problem. CoRR abs/1308.6206 (2013) - 2012
- [j6]Erich Christian Teppan, Alexander Felfernig:
Minimization of decoy effects in recommender result sets. Web Intell. Agent Syst. 10(4): 385-395 (2012) - [c15]Erich Christian Teppan, Gerhard Friedrich, Andreas A. Falkner:
QuickPup: A Heuristic Backtracking Algorithm for the Partner Units Configuration Problem. IAAI 2012: 2329-2334 - [c14]Erich Christian Teppan:
Re-configuring Legacy Instances of the Partner Units Problem. ICTAI 2012: 154-161 - 2011
- [j5]Monika Mandl, Alexander Felfernig, Erich Teppan, Monika Schubert:
Consumer decision making in knowledge-based recommendation. J. Intell. Inf. Syst. 37(1): 1-22 (2011) - 2010
- [c13]Alexander Felfernig, Monika Schubert, Monika Mandl, Gerhard Friedrich, Erich Teppan:
Efficient Explanations for Inconsistent Constraint Sets. ECAI 2010: 1043-1044 - [c12]Alexander Felfernig, Monika Mandl, Stefan Schippel, Monika Schubert, Erich Teppan:
Adaptive Utility-Based Recommendation. IEA/AIE (1) 2010: 641-650 - [c11]Erich Christian Teppan, Gerhard Friedrich, Alexander Felfernig:
Impacts of Decoy Effects on the Decision Making Ability. CEC 2010: 112-119
2000 – 2009
- 2009
- [j4]Alexander Felfernig, Gerhard Friedrich, Klaus Isak, Kostyantyn M. Shchekotykhin, Erich Teppan, Dietmar Jannach:
Automated debugging of recommender user interface descriptions. Appl. Intell. 31(1): 1-14 (2009) - [j3]Erich Christian Teppan, Alexander Felfernig:
Impacts of decoy elements on result set evaluations in knowledge-based recommendation. Int. J. Adv. Intell. Paradigms 1(3): 358-373 (2009) - [c10]Alexander Felfernig, Markus Mairitsch, Monika Mandl, Monika Schubert, Erich Teppan:
Utility-Based Repair of Inconsistent Requirements. IEA/AIE 2009: 162-171 - [c9]Erich Christian Teppan, Alexander Felfernig:
Calculating Decoy Items in Utility-Based Recommendation. IEA/AIE 2009: 183-192 - [c8]Alexander Felfernig, Gerhard Friedrich, Monika Schubert, Monika Mandl, Markus Mairitsch, Erich Teppan:
Plausible Repairs for Inconsistent Requirements. IJCAI 2009: 791-796 - [c7]Erich Christian Teppan, Alexander Felfernig:
Minimization of Product Utility Estimation Errors in Recommender Result Set Evaluations. Web Intelligence 2009: 20-27 - [c6]Erich Christian Teppan, Alexander Felfernig:
Asymmetric Dominance- and Compromise Effects in the Financial Services Domain. CEC 2009: 57-64 - [c5]Erich Christian Teppan, Alexander Felfernig:
Der Asymmetrische Dominanzeffekt und seine Bedeutung für E-Tourismus-Plattformen. Wirtschaftsinformatik (2) 2009: 791-800 - 2008
- [c4]Alexander Felfernig, Erich Teppan, Gerhard Friedrich, Klaus Isak:
Intelligent debugging and repair of utility constraint sets in knowledge-based recommender applications. IUI 2008: 217-226 - [c3]Alexander Felfernig, Bartosz Gula, Gerhard Leitner, Marco Maier, Rudolf Melcher, Erich Teppan:
Persuasion in Knowledge-Based Recommendation. PERSUASIVE 2008: 71-82 - [c2]Erich Christian Teppan:
Implications of psychological phenomenons for recommender systems. RecSys 2008: 323-326 - [p1]Alexander Felfernig, Erich Teppan, Bartosz Gula:
User Acceptance of Knowledge-based Recommenders. Personalization Techniques and Recommender Systems 2008: 249-276 - 2007
- [j2]Alexander Felfernig, Erich Teppan, Bartosz Gula:
Knowledge-Based Recommender Technologies for Marketing and Sales. Int. J. Pattern Recognit. Artif. Intell. 21(2): 333-354 (2007) - [j1]Alexander Felfernig, Klaus Isak, Gerold Kreutler, Thomas Kruggel, Erich Teppan:
Knowledge representations for the interactive selling of financial services. Inf. Syst. E Bus. Manag. 5(2): 143-166 (2007) - [c1]Alexander Felfernig, Gerhard Friedrich, Bartosz Gula, Martin Hitz, Thomas Kruggel, Gerhard Leitner, Rudolf Melcher, D. Riepan, S. Strauss, Erich Teppan, Oliver Vitouch:
Persuasive Recommendation: Serial Position Effects in Knowledge-Based Recommender Systems. PERSUASIVE 2007: 283-294
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-27 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint