![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jens Weise
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Jens Weise
, Sanaz Mostaghim
:
Finding Sets of Solutions for Temporal Uncertain Problems. EvoApplications@EvoStar 2024: 209-223 - 2023
- [b1]Jens Weise:
Evolutionary many-objective optimisation for pathfinding problems. Otto-von-Guericke University Magdeburg, Germany, 2023 - [j3]Jens Weise
, Sanaz Mostaghim
:
A comparison of distance metrics for the multi-objective pathfinding problem. Nat. Comput. 22(2): 315-328 (2023) - [c9]Julia Heise
, Jens Weise
, Sanaz Mostaghim
:
Towards Benchmarking of Pathfinding Algorithms in Path-Influenced Environments. GECCO Companion 2023: 69-70 - 2022
- [j2]Jens Weise
, Sanaz Mostaghim
:
A Scalable Many-Objective Pathfinding Benchmark Suite. IEEE Trans. Evol. Comput. 26(1): 188-194 (2022) - 2021
- [j1]Victor Charpenay
, Daniel Schraudner
, Thomas Seidelmann, Torsten Spieldenner, Jens Weise
, René Schubotz
, Sanaz Mostaghim
, Andreas Harth:
MOSAIK: A Formal Model for Self-Organizing Manufacturing Systems. IEEE Pervasive Comput. 20(1): 9-18 (2021) - [c8]Jens Weise
, Sanaz Mostaghim
:
Many-Objective Pathfinding Based on Fréchet Similarity Metric. EMO 2021: 375-386 - [c7]Thomas Seidelmann, Jens Weise, Sanaz Mostaghim
:
Meeting Demands for Mass Customization: A Hybrid Organic Computing Approach. SSCI 2021: 1-8 - [c6]Jens Weise, Sanaz Mostaghim
:
A Customized Niching Methodology for the Many-Objective Pathfinding Problem. SSCI 2021: 1-8 - [c5]Jens Weise, Heiner Zille, Sanaz Mostaghim
:
A Comparative Study of Different Encodings on the Multi-Objective Pathfinding Problem. SSCI 2021: 1-8 - 2020
- [c4]Jens Weise
, Sebastian Mai
, Heiner Zille, Sanaz Mostaghim
:
On the Scalable Multi-Objective Multi-Agent Pathfinding Problem. CEC 2020: 1-8 - [c3]Jens Weise
, Sanaz Mostaghim
:
A many-objective route planning benchmark problem for navigation. GECCO Companion 2020: 183-184 - [d1]Jens Weise
, Sanaz Mostaghim
:
Scalable Many-Objective Pathfinding Benchmark Suite Pareto-fronts and Sets. IEEE DataPort, 2020 - [i1]Jens Weise, Sanaz Mostaghim:
Scalable Many-Objective Pathfinding Benchmark Suite. CoRR abs/2010.04501 (2020)
2010 – 2019
- 2019
- [c2]Jens Weise
, Steven Benkhardt, Sanaz Mostaghim
:
Graph-based multi-objective generation of customised wiring harnesses. GECCO (Companion) 2019: 407-408 - 2018
- [c1]Jens Weise
, Steven Benkhardt, Sanaz Mostaghim
:
A Survey on Graph-based Systems in Manufacturing Processes. SSCI 2018: 112-119
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-06-19 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint