Dennis Weyland
According to our database1,
Dennis Weyland
authored at least 20 papers
between 2008 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2020
A structured view on weighted counting with relations to counting, quantum computation and applications.
Inf. Comput., 2020
2019
The Full Event Interpretation: An Exclusive Tagging Algorithm for the Belle II Experiment.
Comput. Softw. Big Sci., December, 2019
2018
Int. Trans. Oper. Res., 2018
2015
Metaheuristics and Cloud Computing: A Case Study on the Probabilistic Traveling Salesman Problem with Deadlines.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2015, 2015
2014
On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines.
Theor. Comput. Sci., 2014
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
2013
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., 2013
A Structured View on Weighted Counting with Relations to Quantum Computation and Applications.
Electron. Colloquium Comput. Complex., 2013
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling.
Comput. Oper. Res., 2013
An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2013, 2013
2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Proceedings of the Bio-Inspired Models of Network, Information, and Computing Systems, 2012
2011
Proceedings of the Operations Research Proceedings 2011, Selected Papers of the International Conference on Operations Research (OR 2011), August 30, 2011
Using Statistical Tests for Improving State-of-the-Art Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011
2010
A Rigorous Analysis of the Harmony Search Algorithm: How the Research Community can be Misled by a "Novel" Methodology.
Int. J. Appl. Metaheuristic Comput., 2010
Algorithmica, 2010
2009
New Approximation-Based Local Search Algorithms for the Probabilistic Traveling Salesman Problem.
Proceedings of the Computer Aided Systems Theory, 2009
2008
Simulated annealing, its parameter settings and the longest common subsequence problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2008