Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Matija Javorski

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▷ joint publications with Tea Tusar

> Home > Persons > Matija Javorski

Publications

2014
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/asc/DovganJTGF14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/asc/DovganJTGF14
Erik Dovgan, Matija Javorski, Tea Tusar, Matjaz Gams, Bogdan Filipic:
Discovering driving strategies with a multiobjective optimization algorithm. Appl. Soft Comput. 16: 50-62 (2014)
2013
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/eswa/DovganJTGF13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eswa/DovganJTGF13
Erik Dovgan, Matija Javorski, Tea Tusar, Matjaz Gams, Bogdan Filipic:
Comparing a multiobjective optimization algorithm for discovering driving strategies with humans. Expert Syst. Appl. 40(7): 2687-2695 (2013)
2012
[j1]
- view
  - electronic edition @ informatica.si (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/informaticaSI/DovganTJF12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informaticaSI/DovganTJF12
Erik Dovgan, Tea Tusar, Matija Javorski, Bogdan Filipic:
Discovering Comfortable Driving Strategies Using Simulation-Based Multiobjective Optimization. Informatica (Slovenia) 36(3): 319-326 (2012)

a service of

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.