default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDennis Weyland
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j9]Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland:
A structured view on weighted counting with relations to counting, quantum computation and applications. Inf. Comput. 275: 104627 (2020)
2010 – 2019
- 2019
- [j8]Thomas Keck, Fernando Abudinén
, Florian U. Bernlochner, R. Cheaib, Sam Cunliffe, Michael Feindt, Torben Ferber, Moritz Gelb, Jochen Gemmler, Pablo Goldenzweig, Martin Heck, Sophie Hollitt, James Kahn, Jo-Frederik Krohn, Thomas Kuhr, I. Komarov, L. Ligioi, Matic Lubej, Felix Metzner, Markus Prim, Christian Pulvermacher, Martin Ritter, J. Schwab, W. Sutcliffe, U. Tamponi, Francesco Tenchini, N. E. Toutounji, P. Urquijo, Dennis Weyland, Anze Zupanc:
The Full Event Interpretation: An Exclusive Tagging Algorithm for the Belle II Experiment. Comput. Softw. Big Sci. 3(1) (2019) - 2018
- [j7]Claudia Archetti, M. Grazia Speranza, Dennis Weyland:
A simulation study of an on-demand transportation system. Int. Trans. Oper. Res. 25(4): 1137-1161 (2018) - 2017
- [i3]Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland:
A Structured View on Weighted Counting with Relations to Counting, Quantum Computation and Applications. CoRR abs/1701.06386 (2017) - 2015
- [c10]Dennis Weyland:
Metaheuristics and Cloud Computing: A Case Study on the Probabilistic Traveling Salesman Problem with Deadlines. EUROCAST 2015: 279-285 - [i2]Dennis Weyland:
Some Comments on the Stochastic Eulerian Tour Problem. CoRR abs/1503.04177 (2015) - 2014
- [j6]Dennis Weyland:
On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines. Theor. Comput. Sci. 540: 156-168 (2014) - [c9]Cassio Polpo de Campos, Georgios Stamoulis, Dennis Weyland:
The Computational Complexity of Stochastic Optimization. ISCO 2014: 173-185 - 2013
- [j5]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling. Comput. Oper. Res. 40(7): 1661-1670 (2013) - [j4]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines. J. Parallel Distributed Comput. 73(1): 74-85 (2013) - [c8]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU. EUROCAST (1) 2013: 332-339 - [i1]Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland:
A Structured View on Weighted Counting with Relations to Quantum Computation and Applications. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j3]Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland:
Coupling ant colony systems with strong local searches. Eur. J. Oper. Res. 220(3): 831-843 (2012) - [c7]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
An Enhanced Ant Colony System for the Probabilistic Traveling Salesman Problem. BIONETICS 2012: 237-249 - [c6]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines. ISCO 2012: 392-403 - 2011
- [c5]Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
Using Statistical Tests for Improving State-of-the-Art Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines. EUROCAST (1) 2011: 448-455 - [c4]Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland:
An Enhanced Ant Colony System for the Sequential Ordering Problem. OR 2011: 355-360 - 2010
- [j2]Thomas Jansen, Dennis Weyland:
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. Algorithmica 57(1): 170-186 (2010) - [j1]Dennis Weyland:
A Rigorous Analysis of the Harmony Search Algorithm: How the Research Community can be Misled by a "Novel" Methodology. Int. J. Appl. Metaheuristic Comput. 1(2): 50-60 (2010)
2000 – 2009
- 2009
- [c3]Dennis Weyland, Leonora Bianchi, Luca Maria Gambardella:
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem. EUROCAST 2009: 681-688 - 2008
- [c2]Dennis Weyland:
Simulated annealing, its parameter settings and the longest common subsequence problem. GECCO 2008: 803-810 - 2007
- [c1]Thomas Jansen, Dennis Weyland:
Analysis of evolutionary algorithms for the longest common subsequence problem. GECCO 2007: 939-946
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-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
